Divisors#2186

Divisors

1 second
64 megabytes
Easy

A natural number is called a divisor of a natural number if b = ac for some natural number . For example, the divisors of are , , , and . Two numbers are called coprime if they have no common divisors other than . For example, and are coprime, but and are not.

We call a set of numbers (a_1, a_2, \ldots, a_k) normal if the following conditions are satisfied:

  1. each number a_i is a divisor of ;

  2. a_1 < a_2 < \ldots < a_k;

  3. for every from to k-1, the numbers a_i and a_{i+1} are coprime;

  4. the product a_1 a_2 \ldots a_k does not exceed .

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

Write a program that, given and , determines the number of normal sets of divisors of .

Input

The first line contains two integers: and (2 \leq n \leq 10^8, 2 \leq k \leq 10).

Output

Print a single integer — the number of normal sets of divisors of .

Examples

Example 1

Loading
Loading