#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1000000007;
int n, m, ccnt, b[150005], ans = 1;
inline int ksm(int p, int q) {
	int base = 1;
	while (q) {
		if (q & 1) base = base * p % mod;
		p = p * p % mod;
		q >>= 1;
	}
	return base;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 2; i <= sqrt(n); i++) {
		int cnt = i;
		while (n % i == 0) {
			ans = ans * ksm(i, (m / cnt)) % mod;
			cnt = cnt * i;
			n /= i;
		}
	}
	if (n) {
		ans = ans * ksm(n, (m / n)) % mod;
	}
	cout << ans;
}