#include <bits/stdc++.h>
using namespace std;
int64_t const base = 1e9 + 7;
vector<int> Primes;
map<int64_t, int64_t> mp;
map<int64_t, int64_t>::iterator it;
void Fact(int64_t first) {
  for (int64_t i = 2; i * i <= first; i++) {
    if (first % i == 0) {
      mp[i] = 0;
      while (first % i == 0) {
        first /= i;
      }
    }
  }
  if (first != 1) mp[first] = 1;
}
int64_t Pow(int64_t a, int64_t b) {
  if (b == 0) return 1LL % base;
  int64_t tmp = Pow(a, b / 2);
  tmp = (tmp * tmp) % base;
  if (b % 2 == 0)
    return tmp;
  else
    return tmp * a % base;
}
int64_t poww(int64_t a, int64_t b) {
  if (b == 0) return 1LL;
  int64_t tmp = Pow(a, b / 2);
  tmp = (tmp * tmp);
  if (b % 2 == 0)
    return tmp;
  else
    return tmp * a;
}
int main() {
  ios_base::sync_with_stdio(0);
  int64_t first;
  int64_t n;
  cin >> first >> n;
  Fact(first);
  int64_t ans = 1;
  for (it = mp.begin(); it != mp.end(); it++) {
    int64_t pre = n, cur = 0, k = (*it).first;
    int64_t s = k;
    int64_t cnt = 0, _n = n;
    cerr << "k"
         << " = " << k << '\n';
    ;
    while (_n >= k) {
      _n /= k;
      cnt++;
    }
    for (int i = 1; i <= cnt; i++) {
      cur = n / poww(k, i);
      ans = (ans * Pow(Pow(k, i - 1), pre - cur) + base) % base;
      pre = cur;
    }
    ans = (ans * (Pow(Pow(k, cnt), cur)) + base) % base;
  }
  cout << ans;
}
