import java.util.*;

public class TestHashMap {      
    
    public static void main(String[] args) {

	int n = Integer.parseInt(args[0]); // number of bits
	int m = Integer.parseInt(args[1]); // number of iterations

	Random gen = new Random();

	Map<BitSet,State> M = new HashMap<BitSet,State>();

	for (int iteration=0;iteration<m;iteration++){
	    BitSet key = new BitSet(n);
	    for (int i=0;i<n;i++) if (gen.nextInt(2) == 1) key.set(i);
	    //
	    // creates a random BitSet
	    //

	    State state = M.get(key);
	    if (state != null) state.inc();
	    else M.put(key,new State(key,n));
	    //
	    // if the state already exists increment its counter
	    // otherwise it is a new state
	}

	
	Iterator it = M.entrySet().iterator();
	while (it.hasNext()){
	    Map.Entry pairs = (Map.Entry)it.next();
	    System.out.println(pairs.getValue());
	}
	//
	// print out all states with their counters
	//
    }
}