#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, z, cnt = 0, x = 0;
long long p = 1e9 + 7;
long long pr[200050];
long long e[200050] = {0};
long long dp[60] = {0};
long long inv[61] = {1, 1};
long long qp(long long a, long long b) {
  long long r = 1;
  if (b < 0) a = qp(a, p - 2), b = -b;
  for (; b; b >>= 1, a = a * a % p)
    if (b & 1) r = r * a % p;
  return r;
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long tp = n;
  for (i = 2; i < 61; i++) inv[i] = (p - p / i) * inv[p % i] % p;
  for (i = 2; i * i <= tp; i++)
    if (tp % i == 0)
      for (pr[cnt++] = i; tp % i == 0; tp /= i, e[cnt - 1]++)
        ;
  if (tp > 1) pr[cnt++] = tp, e[cnt - 1]++;
  long long ans = 1;
  for (i = 0; i < cnt; i++) {
    fill(dp, dp + 60, 0);
    dp[e[i]] = 1;
    for (j = 0; j < k; j++) {
      for (l = 0; l < e[i] + 1; l++) {
        dp[l] = dp[l] * inv[l + 1] % p;
        for (z = l + 1; z < e[i] + 1; z++) {
          dp[l] = (dp[l] + dp[z] * inv[z + 1]) % p;
        }
      }
    }
    long long tp = 0;
    for (j = 0; j < e[i] + 1; j++) {
      tp = (tp + qp(pr[i], j) * dp[j]) % p;
    }
    ans = ans * tp % p;
  }
  cout << ans << endl;
  return ~~(0 ^ 0 ^ 0);
}
