import java.math.BigInteger;
import java.util.Scanner;

public class Main {

	public static BigInteger Factorial(int n) {
		BigInteger b = BigInteger.ONE;
		for(int i = 2;i <= n;i++) {
			BigInteger t = new BigInteger(String.valueOf(i));
			b = b.multiply(t);
		}
		return b;
	}
	
	public static BigInteger p(int n, int m) {
		BigInteger ans = Factorial(n).divide(Factorial(n-m));
		return ans;
	}
	
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int n, m, cnt;
		while(input.hasNext()) {
			n = input.nextInt();
			m = input.nextInt();
			if(n == 0 && m == 0) break;
			BigInteger b = p(n, m);
			cnt = 0;
			BigInteger TWO = new BigInteger(String.valueOf(2));
			while(b != BigInteger.ZERO) {
				if(b.remainder(TWO) == BigInteger.ZERO) {
					cnt++;
					b = b.divide(TWO);
				}
				else break;
			}
			System.out.println(cnt);
		}
		input.close();
	}

}