题库练习 Makoto and a Blackboard
← 上一题 下一题 →

A12331 | Makoto and a Blackboard

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Makoto has a big blackboard with a positive integer $n$ written on it. He will perform the following action exactly $k$ times:

Suppose the number currently written on the blackboard is $v$ . He will randomly pick one of the divisors of $v$ (possibly $1$ and $v$ ) and replace $v$ with this divisor. As Makoto uses his famous random number generator (RNG) and as he always uses $58$ as his generator seed, each divisor is guaranteed to be chosen with equal probability.

He now wonders what is the expected value of the number written on the blackboard after $k$ steps.

It can be shown that this value can be represented as $\frac{P}{Q}$ where $P$ and $Q$ are coprime integers and $Q \not\equiv 0 \pmod{10^9+7}$ . Print the value of $P \cdot Q^{-1}$ modulo $10^9+7$ .

输入格式

The only line of the input contains two integers $n$ and $k$ ( $1 \leq n \leq 10^{15}$ , $1 \leq k \leq 10^4$ ).

输出格式

Print a single integer — the expected value of the number on the blackboard after $k$ steps as $P \cdot Q^{-1} \pmod{10^9+7}$ for $P$ , $Q$ defined above.

输入输出样例

输入 #1
6 1
输出 #1
3
输入 #2
6 2
输出 #2
875000008
输入 #3
60 5
输出 #3
237178099
C++ 编辑器
输入
输出