#include <bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int mod = 1e9 + 7;
int n, m;
vector < pair <int, int> > pos;

ll ksm(ll a, int b) {
	ll ans = 1;
	for (; b; b >>= 1, a = a * a % mod) {
		if (b & 1) ans = ans * a % mod;
	}
	return ans;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 2; 1ll * i * i <= n; i++) {
		if (n % i == 0) {
			int cnt = 0;
			while (n % i == 0) n /= i, cnt++;
			pos.push_back({i, cnt});
		}
	}
	if (n) {
		pos.push_back({n, 1});
	}
	ll ans = 1;
	for (auto qwq : pos) {
		int x = qwq.first, y = qwq.second;
		int sum = 1;
		for (int i = 1; i <= y; i++) sum *= x;
		int lst = 0;
		for (int i = y; i >= 1; i--) {
			ans = ans * ksm(sum, m / sum - lst) % mod;
			lst = m / sum;
			sum /= x;
		}
	}
	cout << ans;
	QwQ330AwA;
}