Divisors

A natural number (a) is referred to as a divisor of another natural number (b) if there exists a natural number (c) such that (b = ac). For instance, the divisors of (6) are (1), (2), (3), and (6). Two numbers are termed coprime if their only common divisor is (1). For example, (16) and (27) are coprime, whereas (18) and (24) are not.

We define a set of (k) numbers ((a_1, a_2, ..., a_k)) as normal if it satisfies the following conditions:

1. Each number (a_i) is a divisor of the number (n).

2. The sequence (a_1 < a_2 < ...< a_k) is strictly increasing.

3. For every (i) from (1) to (k - 1), the numbers (a_i) and (a_i+1) are coprime.

4. The product (a_1 $\times$ a_2 $\times$ ...$\times$ a_k) does not exceed (n).

For example, the set ((2, 9, 10)) is a normal set of (3) divisors of the number (360).

Your task is to write a program that, given the values (n) and (k), calculates the number of normal sets of (k) divisors of the number (n).

Input

The first line of the input file contains two integers: (n) and (k) ((2 $\le$ n $\le$ 10^8), (2 $\le$ k $\le$ 10)).

Output

The output file should contain a single number — the count of normal sets of (k) divisors of the number (n).

Examples