#include <bits/stdc++.h>
using namespace std;
vector<unsigned long long> primes;
void primeFactors(unsigned long long n) {
  if (n % 2 == 0) {
    primes.push_back(2);
    while (n % 2 == 0) n = n / 2;
  }
  for (unsigned long long i = 3; i <= sqrt(n); i = i + 2) {
    if (n % i == 0) {
      primes.push_back(i);
      while (n % i == 0) n = n / i;
    }
  }
  if (n > 2) primes.push_back(n);
}
unsigned long long power_count(unsigned long long n, unsigned long long p) {
  unsigned long long x = 0;
  while (n) {
    n /= p;
    x += n;
  }
  return x;
}
unsigned long long moduloMultiplication(unsigned long long a,
                                        unsigned long long b,
                                        unsigned long long mod) {
  unsigned long long res = 0;
  a %= mod;
  while (b) {
    if (b % 2 == 1) res = (res + a) % mod;
    a = (2 * a) % mod;
    a %= mod;
    b /= 2;
  }
  return res;
}
unsigned long long exponentMod(unsigned long long A, unsigned long long B,
                               unsigned long long C) {
  if (A == 0) return 0;
  if (B == 0) return 1;
  unsigned long long y;
  if (B % 2 == 0) {
    y = exponentMod(A, B / 2, C);
    y %= C;
    y = moduloMultiplication(y, y, C);
    y %= C;
  } else {
    y = A % C;
    unsigned long long temp = exponentMod(A, B - 1, C);
    y = moduloMultiplication(y, temp, C);
    y %= C;
  }
  return y % C;
}
unsigned long long power_exp(unsigned long long x, unsigned long long y,
                             unsigned long long p) {
  unsigned long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  unsigned long long x, n;
  cin >> x >> n;
  primes.clear();
  primeFactors(x);
  unsigned long long ans = 1;
  for (unsigned long long i = 0; i < primes.size(); i++) {
    unsigned long long p = primes[i];
    unsigned long long pow_cnt = power_count(n, p);
    unsigned long long temp = exponentMod(p, pow_cnt, 1000000007);
    temp %= 1000000007;
    ans *= temp;
    ans %= 1000000007;
  }
  cout << ans << endl;
  return 0;
}
