### Divisors

Time Limit: 5000 ms Memory Limit: 10000 KiB

#### Problem Description

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

#### Input

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.

#### Output

For each instance, output a line containing exactly one integer -- the number of distinct divisors of Cnk. For the input instances, this number does not exceed 263 - 1.

#### Sample Input

5 1
6 3
10 4

#### Sample Output

2
6
16

#### Hint

nkoj1389 有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。

CTU Open 2005