import java.util.*;

public class TestTreeMap {      

    private static int pow(int n,int m){
	if (m==0) return 1;
	return n * pow(n,m-1);
    }
    //
    // raise n to the power m
    //
    
    public static void main(String[] args) {

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

	Random gen = new Random();

	Map<Integer,State> M = new TreeMap<Integer,State>();

	for (int iteration=0;iteration<m;iteration++){
	    int key = gen.nextInt(max);
	    State state = M.get(key);
	    if (state != null) state.inc();
	    else M.put(key,new State(key,n));
	}

	
	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
	//
    }
}