#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double Pi = acos(-1);
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
double dpow(double a, long long b) {
  double ans = 1.0;
  while (b) {
    if (b % 2) ans = ans * a;
    a = a * a;
    b /= 2;
  }
  return ans;
}
long long quick_pow(long long x, long long y) {
  long long ans = 1;
  while (y) {
    if (y & 1) {
      ans = ans * x % mod;
    }
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
int noprime[maxn * 10], pcnt, p[maxn * 10];
void getprime(int N) {
  pcnt = 0;
  memset(noprime, 0, sizeof(noprime));
  noprime[0] = noprime[1] = 1;
  for (int i = 2; i < N; ++i) {
    if (!noprime[i]) {
      p[pcnt++] = i;
    }
    for (int j = 0; j < pcnt && i * p[j] < N; ++j) {
      noprime[i * p[j]] = 1;
      if (i % p[j] == 0) break;
    }
  }
}
long long x, n;
vector<int> vec;
void check(long long x) {
  for (int i = 0; i < pcnt; i++) {
    if (x < p[i]) break;
    if (x % p[i] == 0) vec.push_back(p[i]);
    while (x % p[i] == 0) {
      x /= p[i];
    }
  }
  if (x == 1) return;
  int flag = 1;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      flag = 0;
      break;
    }
  }
  if (flag) vec.push_back(x);
}
long long solve(long long num) {
  long long tmp = n / num;
  long long sum = tmp;
  while (tmp) {
    sum += tmp / num;
    tmp /= num;
  }
  return quick_pow(num, sum);
}
int main() {
  scanf("%lld%lld", &x, &n);
  getprime(1e6 + 5);
  check(x);
  int sz = vec.size();
  long long ans = 1;
  for (int i = 0; i < sz; i++) {
    ans = ans * solve(vec[i]) % mod;
  }
  printf("%lld\n", ans);
}
