#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int dp[10005][60], N;
long long P;
map<long long, int> mp;
void pc(long long x) {
  for (long long d = 2; d * d <= x; d++)
    while (x % d == 0) {
      x /= d;
      mp[d]++;
    }
  if (x > 1) mp[x]++;
}
void fmain(int tid) {
  scanf("%lld%d", &ln, &k);
  pc(ln);
  int ans = 1;
  for (auto& p : mp) {
    P = p.first;
    int cc = p.second;
    for (int(i) = 0; (i) < (int)(k + 1); (i)++)
      for (int(j) = 0; (j) < (int)(cc + 1); (j)++) dp[i][j] = 0;
    dp[0][cc] = 1;
    for (int(i) = 1; (i) <= (int)(k); (i)++) {
      int zz = 0;
      for (int j = cc; j >= 0; j--) {
        addmod(zz, (long long)dp[i - 1][j] * fastPow(j + 1, 1000000007 - 2) %
                       1000000007);
        dp[i][j] = zz;
      }
    }
    int tmp = 0;
    for (int(j) = 0; (j) < (int)(cc + 1); (j)++) {
      addmod(tmp, (long long)dp[k][j] * fastPow(P, j) % 1000000007);
    }
    ans = (long long)ans * tmp % 1000000007;
  }
  printf("%d\n", ans);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
