题目描述

Now, Special Week are doing some problems with factors. And here comes one problem difficult to her, which she needs you to help her solve it out.

The problem is:

Given you two positive integers $n$ and $m$ find the number of different cases which satisfies the condition: $f_1 \ imes f_2 \ imes f_3 \ imes ... \ imes f_m=n$ where $f_i$ is any positive integer. For example, if $n=4$ and $m=3$ we can find $6$ cases to satisfy the cases which is listed below:

$1 \ imes 1 \ imes 1$

$1 \ imes 1 \ imes 4$

$1 \ imes 4 \ imes 1$

$4 \ imes 1 \ imes 1$

$2 \ imes 2 \ imes 1$

$2 \ imes 1 \ imes 2$

$1 \ imes 2 \ imes 2$

输入格式

One line with two positive integers $n,m (1\\le n\\le 10^{16},1\\le m\\le 4)$.

输出格式

One positive integer the answer.

样例

2021041820210418 3

2430

2021041820210418 4

20480

4444444444444444 4

40960