#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int inf = 0x3f3f3f3f;
const long long mod = 1000000007;
vector<long long> pri;
void div(long long x) {
  for (long long k = 2; k * k <= x; k++) {
    if (x % k == 0) {
      pri.push_back(k);
      while (x % k == 0) x /= k;
    }
  }
  if (x > 1) pri.push_back(x);
}
long long Ksc(long long a, long long b, long long mod) {
  a %= mod, b %= mod;
  return ((a * b -
           (long long)((long long)((long double)a / mod * b + 1e-3) * mod)) %
              mod +
          mod) %
         mod;
}
long long Ksm(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = Ksc(res, a, mod);
    a = Ksc(a, a, mod);
    b >>= 1;
  }
  return res;
}
int findl(long long it, long long n) {
  long long ba = 1;
  int cnt = 0;
  while ((n / ba) >= it) {
    ba *= it;
    cnt++;
  }
  return cnt;
}
int main() {
  long long x, n;
  scanf("%lld %lld", &x, &n);
  div(x);
  long long ans = 1;
  for (long long it : pri) {
    int la = findl(it, n);
    long long mul = 1;
    for (int i = 1; i <= la; i++) mul *= it;
    long long cnt, pre = 0;
    for (int i = la; i >= 1; i--) {
      cnt = n / mul;
      ans = ans * Ksm(mul, cnt - pre, mod) % mod;
      pre = cnt;
      mul /= it;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
