#include <bits/stdc++.h>
using namespace std;
long long F(long long N, long long P) {
  if (P == 0) return 1;
  if (P % 2 == 0) {
    long long ret = F(N, P / 2);
    return ((ret % 1000000007) * (ret % 1000000007)) % 1000000007;
  } else
    return ((N % 1000000007) * (F(N, P - 1) % 1000000007)) % 1000000007;
}
long long prime(long long n) {
  if (n == 1) {
    return 0;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return 0;
    }
  }
  return 1;
}
int main() {
  long long n, x, i, ans = 1, n1;
  scanf("%lld %lld", &x, &n1);
  long long p[100005], ind = 0;
  if (x % 2 == 0) {
    p[ind] = 2;
    ind++;
    if (prime(x / 2) == 1 && x != 4) {
      p[ind] = x / 2;
      ind++;
    }
  }
  for (i = 3; i * i <= x; i++) {
    if (x % i == 0 && prime(i) == 1) {
      p[ind] = i;
      ind++;
    }
    if (x % i == 0 && prime(x / i) == 1 && i * i != x) {
      p[ind] = x / i;
      ind++;
    }
  }
  if (ind == 0) {
    p[ind] = x;
    ind++;
  }
  for (i = 0; i < ind; i++) {
    long long a = p[i];
    long long num = p[i];
    long long n = n1;
    long long cnt = 0;
    while (1) {
      long long f = n / num;
      cnt += f;
      if (num <= n / a) {
        num *= a;
      } else {
        break;
      }
    }
    ans = (ans * F(a, cnt)) % 1000000007;
  }
  printf("%lld", ans);
}
