#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b, long long mod) {
  if (b == 0 || a == 1) {
    if (mod == 1)
      return 0;
    else
      return 1;
  }
  if (b % 2 == 0) {
    long long k = powmod(a, b / 2, mod);
    return (k * k) % mod;
  } else {
    long long k = powmod(a, b / 2, mod);
    return ((k * k) % mod * a) % mod;
  }
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a > b)
    return gcd(a % b, b);
  else
    return gcd(b % a, a);
}
long long prime(long long p) {
  for (long long i = 2; i * i <= p; i++) {
    if (p % i == 0 && i < p) return i;
  }
  return 1;
}
long long sqr(long long i) { return i * i; }
void solve(long long ppppppppp = 1) {
  long long x, n;
  cin >> x >> n;
  vector<long long> q;
  long long cur = x;
  for (long long i = 2; i * i <= x; i++) {
    if (cur % i == 0) {
      q.push_back(i);
    }
    while (cur % i == 0) cur /= i;
  }
  if (cur != 1) q.push_back(cur);
  long long mod = 1000000007;
  long long ans = 1;
  for (long long i = 0; i < q.size(); i++) {
    long long curpow = 0;
    long long y = n;
    while (y != 0) {
      curpow += y / q[i];
      y /= q[i];
    }
    ans *= powmod(q[i], curpow, mod);
    ans %= mod;
  }
  cout << ans;
  return;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tututu;
  tututu = 1;
  for (long long qwerty = 0; qwerty < tututu; qwerty++) solve();
  return 0;
}
