#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long dp[205], inv[205], ans, pre[205], n, k;
vector<pair<long long, long long> > v;
inline void divide(long long n) {
  long long cur = n;
  for (long long i = 2; i * i <= n; ++i)
    if (cur % i == 0) {
      long long tot = 0;
      do cur /= i, ++tot;
      while (cur % i == 0);
      v.push_back(make_pair(i, tot));
    }
  if (cur > 1) v.push_back(make_pair(cur, 1));
}
signed main() {
  cin >> n >> k;
  divide(n);
  ans = 1;
  inv[1] = 1;
  for (long long i = 2; i <= 200; ++i)
    inv[i] = inv[mod % i] * (mod - mod / i) % mod;
  for (auto it = v.begin(); it != v.end(); ++it) {
    fill(dp, dp + 200, 0);
    dp[it->second] = 1;
    for (long long j = 1; j <= k; ++j) {
      fill(pre, pre + 200, 0);
      for (long long l = 0; l <= it->second; ++l)
        (pre[0] += dp[l] * inv[l + 1] % mod) %= mod,
            (pre[l + 1] -= dp[l] * inv[l + 1] % mod) %= mod;
      for (long long l = 1; l <= it->second; ++l) (pre[l] += pre[l - 1]) %= mod;
      for (long long l = 0; l <= it->second; ++l) dp[l] = pre[l];
    }
    long long res = 0, res1 = 1;
    for (long long j = 0; j <= it->second; ++j)
      (res += res1 * dp[j] % mod) %= mod, (res1 *= it->first) %= mod;
    (ans *= res) %= mod;
  }
  cout << (ans + mod) % mod;
  return 0;
}
