#include <bits/stdc++.h>
using namespace std;
const int MINF = 0x7fffffff;
const int INF = 0x3f3f3f3f;
const int Maxn = 1e5 + 5;
long long mod = 1e9 + 7;
long long mypow(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b % 2) res = res * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return res;
}
long long help(long long p, long long power, long long k) {
  vector<vector<long long>> dp(power + 1, vector<long long>(k + 1));
  dp[0][0] = 1;
  for (int i = 1; i <= power; ++i) dp[i][0] = dp[i - 1][0] * p % mod;
  vector<long long> invs(power + 2, 1);
  for (int i = 1; i <= power + 1; ++i) {
    invs[i] = mypow(i, mod - 2, mod);
  }
  for (int i = 1; i <= k; ++i) {
    for (int f = 0; f <= power; ++f) {
      dp[f][i] = 0;
      for (int d = 0; d <= f; ++d) {
        dp[f][i] += dp[d][i - 1];
        dp[f][i] %= mod;
      }
      dp[f][i] = (dp[f][i] * invs[f + 1]) % mod;
    }
  }
  return dp[power][k];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  long long res = 1;
  for (long long i = 2; i * i <= n; i += 1) {
    if (n % i == 0) {
      int power = 0;
      while (n % i == 0) {
        n /= i;
        power += 1;
      }
      res = res * help(i, power, k) % mod;
    }
  }
  if (n > 1) {
    res = res * help(n, 1, k) % mod;
  }
  cout << res << endl;
  return 0;
}
