#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
bool Finish_read;
template <class T>
inline void read(T &x) {
  Finish_read = 0;
  x = 0;
  int f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    if (ch == EOF) return;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  x *= f;
  Finish_read = 1;
}
template <class T>
inline void print(T x) {
  if (x / 10 != 0) print(x / 10);
  putchar(x % 10 + '0');
}
template <class T>
inline void writeln(T x) {
  if (x < 0) putchar('-');
  x = abs(x);
  print(x);
  putchar('\n');
}
template <class T>
inline void write(T x) {
  if (x < 0) putchar('-');
  x = abs(x);
  print(x);
}
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int max_n = 10005;
namespace {
inline int Add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
inline int Sub(int x, int y) { return (x -= y) < 0 ? x + mod : x; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
inline int Pow(int x, int y = mod - 2) {
  int res = 1;
  while (y) {
    if (y & 1) res = 1ll * res * x % mod;
    x = 1ll * x * x % mod;
    y >>= 1;
  }
  return res;
}
}  // namespace
struct mat {
  int n, m;
  long long a[60][60];
  mat operator*(mat b) {
    mat c;
    c.n = n;
    c.m = b.m;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < b.m; j++) {
        c.a[i][j] = 0;
        for (int k = 0; k < m; k++) {
          (c.a[i][j] += a[i][k] * b.a[k][j]) %= mod;
        }
      }
    }
    return c;
  }
};
mat quick_pow(mat a, long long n) {
  mat c;
  c.n = a.n;
  c.m = a.m;
  for (int i = 0; i < c.n; i++) {
    for (int j = 0; j < c.m; j++) c.a[i][j] = (i == j);
  }
  while (n) {
    if (n & 1) c = c * a;
    a = a * a;
    n >>= 1;
  }
  return c;
}
long long f[max_n * 2];
long long inv[max_n * 2];
long long invn[max_n * 2];
long long C(int n, int m) {
  if (n < m || m < 0) return 0;
  return f[n] * inv[n - m] % mod * inv[m] % mod;
}
void init(int n) {
  f[0] = 1;
  for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % mod;
  inv[n] = Pow(f[n]);
  for (int i = n - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
  invn[1] = 1;
  for (int i = 2; i <= n; i++) invn[i] = invn[mod % i] * (mod - mod / i) % mod;
}
long long n, k;
long long dp[max_n][60];
long long work(long long p, long long c) {
  mat s;
  s.n = c + 1, s.m = 1;
  for (int i = 0; i < s.n; i++) s.a[i][0] = (i == c);
  mat A;
  A.n = A.m = c + 1;
  for (int i = 0; i <= c; i++) {
    for (int j = 0; j <= c; j++) {
      if (j < i)
        A.a[i][j] = 0;
      else
        A.a[i][j] = invn[j + 1];
    }
  }
  A = quick_pow(A, k);
  mat t = A * s;
  long long res = 0, tp = 1;
  for (int i = 0; i <= c; i++)
    res = Add(res, Mul(tp, t.a[i][0])), tp = Mul(tp, p);
  return res;
}
int main() {
  scanf("%lld%lld", &n, &k);
  init(60);
  long long ans = 1;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      int c = 0;
      while (n % i == 0) n /= i, c++;
      ans *= work(i % mod, c), ans %= mod;
    }
  }
  if (n != 1) ans *= work(n % mod, 1), ans %= mod;
  printf("%lld\n", ans);
  return 0;
}
