#include <bits/stdc++.h>
using namespace std;
const int N = 2e2 + 10;
int inv[N];
long long dp[10010][N];
long long qpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % 1000000007;
    n >>= 1;
    x = x * x % 1000000007;
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (int i = 1; i <= 65; i++) inv[i] = qpow(1LL * i, 1000000007 - 2);
  long long n;
  int k;
  cin >> n >> k;
  long long sqn = sqrt(n + 0.5);
  vector<pair<long long, int> > res;
  for (long long i = 2; i <= sqn; i++)
    if (n % i == 0) {
      res.push_back(make_pair(i, 0));
      while (n % i == 0) n /= i, res[res.size() - 1].second++;
    }
  if (n > 1) res.push_back(make_pair(n, 1));
  long long ans = 1, tmp, now;
  for (auto p : res) {
    memset(dp, 0, sizeof(dp));
    dp[0][p.second] = 1LL;
    for (int i = 0; i < k; i++)
      for (int j = 0; j <= p.second; j++)
        for (int l = 0; l <= j; l++)
          dp[i + 1][l] =
              (dp[i + 1][l] + dp[i][j] * inv[j + 1] % 1000000007) % 1000000007;
    tmp = 0, now = 1;
    for (int i = 0; i <= p.second; i++)
      tmp = (tmp + now * dp[k][i] % 1000000007) % 1000000007,
      now = now * p.first % 1000000007;
    ans = ans * tmp % 1000000007;
  }
  ans = (ans % 1000000007 + 1000000007) % 1000000007;
  cout << ans << endl;
  return 0;
}
