Codeforces Round #589 (Div. 2) C - Primes and Multiplication

C. Primes and Multiplication
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

Let’s introduce some definitions that will be needed later.

Let prime(x) be the set of prime divisors of x. For example, prime(140)={2,5,7}, prime(169)={13}.

Let g(x,p) be the maximum possible integer pk where k is an integer such that x is divisible by pk. For example:

g(45,3)=9 (45 is divisible by 32=9 but not divisible by 33=27),
g(63,7)=7 (63 is divisible by 71=7 but not divisible by 72=49).
Let f(x,y) be the product of g(y,p) for all p in prime(x). For example:

f(30,70)=g(70,2)⋅g(70,3)⋅g(70,5)=21⋅30⋅51=10,
f(525,63)=g(63,3)⋅g(63,5)⋅g(63,7)=32⋅50⋅71=63.
You have integers x and n. Calculate f(x,1)⋅f(x,2)⋅…⋅f(x,n)mod(109+7).

Input

The only line contains integers x and n (2≤x≤109, 1≤n≤1018) — the numbers used in formula.

Output

Print the answer.

Examples

input

10 2

output

2

input

20190929 1605

output

363165664

input

947 987654321987654321

output

593574252

Note

In the first example, f(10,1)=g(1,2)⋅g(1,5)=1, f(10,2)=g(2,2)⋅g(2,5)=2.

In the second example, actual value of formula is approximately 1.597⋅10171. Make sure you print the answer modulo (109+7).

In the third example, be careful about overflow issue.

思路：

这是一道数学问题，核心点是一个1-n中有几个m。
计算方法是：
先让t等于m

1. 当m小于等于n时
2. 可以得到1-n内有n/m个能被m整除的数
3. 然后判断n/m是否大于t
4. 小于：跳出循环
5. 大于等于：m*=t
6. 再跳致步骤1

代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <algorithm>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
ll GCD(ll a,ll b) {//最大公约数
    return b == 0 ? a : GCD(b, a % b);
}
const ll mod=1e9+7;
ll _power(ll a, ll b, ll p) { //计算(a^b)%p;
    ll ans = 1;
    while (b) {
        if (b & 1) //等价于b%2，判断b的奇偶性
            ans = ans * a % p; //如果为奇数，证明该位为1，需要乘上a
        a = a * a % p; //计算a^(2^i)
        b >>= 1; //等价于b/=2;
    }
    return ans;
}
signed main() {
    ll m,n;
    while (cin >> m >> n) {
        ll ans = 1;
        for (ll i = 2, ii = sqrt(m); i <= ii; i++) {
            if (m % i == 0) {
                ll sum = i;
                while (sum <= n) {
                    ans = ans * _power(i, n / sum, mod) % mod;
                    sum = (n / sum < i) ? (n + 1) : (sum * i);
                }
                while (m % i == 0) m = m / i;
            }
        }
        if (m != 1) {
            ll sum = m;
            while (sum <= n) {
                ans = ans * _power(m, n / sum, mod) % mod;
                sum = (n / sum < m) ? (n + 1) : (sum * m);
            }
        }
        cout << ans << endl;
    }
}