#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int64_t n, i, j, k, l, sum = 0, flag = 0, t, a[200005], ans = 0;
vector<int64_t> v;
int64_t expo(int64_t base, int64_t exponent, int64_t mod = 1000000007) {
  int64_t ans = 1;
  base %= mod;
  while (exponent != 0) {
    if (exponent & 1) ans = (1LL * ans * base) % mod;
    base = (1LL * base * base) % mod;
    exponent >>= 1;
  }
  return ans % mod;
}
int64_t inverse(int64_t first) {
  return expo(first, 1000000007 - 2, 1000000007);
}
void solve() {
  int64_t n, first;
  cin >> first >> n;
  int64_t temp = first;
  for (int64_t i = 2; i * i <= first; i++) {
    if (temp % i == 0) {
      v.push_back(i);
      while (temp % i == 0) temp /= i;
    }
  }
  if (temp > 1) {
    v.push_back(temp);
  }
  int64_t ans = 1;
  for (auto i : v) {
    int64_t num = i, cur_num = i, po = 0;
    while (cur_num <= n) {
      po += (n / cur_num);
      if (1.0l * cur_num * num > n) break;
      cur_num *= num;
      po %= (1000000007 - 1);
    }
    ans = (ans * expo(num, po, 1000000007)) % 1000000007;
  }
  cout << ans << '\n';
}
signed main() {
  int64_t test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
