#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MOD2 = 998244353;
const long long N = 1e3 + 5;
const long long INF = 1e18 + 5;
const long double pi = 3.14159265359;
void SRAND() {
  auto duration = std::chrono::system_clock::now().time_since_epoch();
  auto millis =
      std::chrono::duration_cast<std::chrono::milliseconds>(duration).count();
  srand(millis);
}
long long x, n, ans = 1;
long long po(long long k, long long ti) {
  if (ti == 0) return 1;
  long long tmp = po(k, ti / 2);
  if (ti & 1) return tmp * tmp % MOD * k % MOD;
  return tmp * tmp % MOD;
}
void f(long long k) {
  long long tmp = 1, tt = 0;
  while (tmp * k <= n && tmp < INF / k) tmp *= k;
  while (tmp > 1) {
    ans *= po(tmp % MOD, (n / tmp - tt) % (MOD - 1));
    ans %= MOD;
    tt += n / tmp - tt;
    tmp /= k;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> x >> n;
  for (long long i = 2; x > 1 && i * i <= x; i++) {
    if (x % i == 0) {
      f(i);
      while (x % i == 0 && x > 1) x /= i;
    }
  }
  if (x > 1) f(x);
  cout << ans << "\n";
  return 0;
}
