#include <bits/stdc++.h>
using lint = long long;
const size_t max_primer = 100000;
const lint mod = 1e9 + 7;
bool is_not_primer[max_primer];
std::vector<int> primer;
lint quickPow(const lint& base, lint pow) {
  lint temp = base, res = 1;
  while (pow) {
    if (pow & 1) {
      res = (res * temp) % mod;
    }
    temp = (temp * temp) % mod;
    pow >>= 1;
  }
  return res;
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout.tie(nullptr);
  for (int i = 2; i < max_primer; i++) {
    if (!is_not_primer[i]) {
      primer.push_back(i);
      for (int j = 2; i * j < max_primer; j++) {
        is_not_primer[i * j] = true;
      }
    }
  }
  lint x, n;
  std::cin >> x >> n;
  lint res = 1;
  for (const auto& p : primer) {
    if ((lint)p * p > x) {
      break;
    }
    if (x % p != 0) {
      continue;
    }
    while (x % p == 0) {
      x /= p;
    }
    lint pow = 0, temp = n;
    while (temp / p != 0) {
      pow += (temp / p);
      temp /= p;
    }
    res = (res * quickPow(p, pow)) % mod;
  }
  if (x != 1) {
    lint pow = 0, temp = n;
    while (temp / x != 0) {
      pow += (temp / x);
      temp /= x;
    }
    res = (res * quickPow(x, pow)) % mod;
  }
  std::cout << res << std::endl;
  return 0;
}
