6662번 - Divisors 다국어

문제

Your task in this problem is to determine the number of divisors of $n \choose k$. Just for fun -- or do you need any special reason for such a useful computation?

입력

The input consists of several instances. Each instance consists of a single line containing two integers n and k (0 ≤ k ≤ n ≤ 431), separated by a single space.

출력

For each instance, output a line containing exactly one integer -- the number of distinct divisors of $n \choose k$. For the input instances, this number does not exceed 2⁶³ - 1.

제한

힌트