Divisors

Problem description

The sequence of k natural numbers (a₁, a₂, …, a_k) is called normal, if they satisfy following rules:

1. each a_i is a divisor of n;
2. a₁ < a₂ < … < a_k;
3. for each i from 1 to k - 1: a_i and a_i+1 are coprime (GCD(a_i, a_i+1) = 1);
4. multiplication of a₁a₂…a_k is not bigger than n.

For example, (2, 9, 10) is normal sequence of length 3 of divisors of 360.

Write a program that according to given n and k will calculate number of normal sequences of length k of divisors of n.

Input

There are two integers in single line of input : n and k (2 ≤ n ≤ 10⁸, 2 ≤ k ≤ 10).

Output

A single integer - number of normal sequences of length k of divisors of n.

Example