#include <iostream>

using namespace std;
typedef unsigned long ulong;

ulong fact( ulong k ) {
	if( k == 0 )
		return 1;

	return k * fact(k-1);
}

int main( int argc, char **argv ) {
	ulong n, k;
	while( cin >> n >> k ) {
		ulong comb = fact(n) / (fact(k) * fact(n-k));
		ulong count = 0;
		for( ulong i=1; i<=comb; i++ ) {
			if( (comb % i) == 0 )
				count++;
		}
		cout << count << endl;
	}
	return 0;
}