#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
  for (char& c : s) c = c == ',' ? ' ' : c;
  stringstream ss;
  ss << s;
  vector<string> res;
  for (string z; ss >> z; res.push_back(z))
    ;
  return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
  if (idx > 0) cerr << ", ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, T...);
}
void localTest() {}
const long long N = 65, K = 1e4 + 5, MOD = 1e9 + 7;
long long dp[N][K], divi[N];
long long power(long long a, long long b, long long c) {
  long long ret = 1;
  while (b) {
    if (b & 1) {
      ret = (ret * a) % c;
    }
    a = (a * a) % c;
    b >>= 1;
  }
  return ret;
}
int main() {
  localTest();
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (long long i = 0; i < N; ++i) {
    divi[i] = power(i + 1, MOD - 2, MOD);
  }
  long long n, k;
  cin >> n >> k;
  vector<pair<long long, long long> > pfactors;
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      long long cnt = 0;
      while (n % i == 0) {
        n /= i;
        ++cnt;
      }
      pfactors.push_back({i, cnt});
    }
  }
  if (n > 1) {
    pfactors.push_back({n, 1});
  }
  long long ans = 1;
  for (auto pfac : pfactors) {
    long long prime = pfac.first, po = pfac.second;
    dp[0][0] = 1;
    for (long long i = 1; i <= po; ++i) {
      dp[i][0] = (dp[i - 1][0] * prime) % MOD;
    }
    for (long long j = 1; j <= k; ++j) {
      long long sum = 0;
      for (long long i = 0; i <= po; ++i) {
        sum = (sum + dp[i][j - 1]) % MOD;
        dp[i][j] = (sum * divi[i]) % MOD;
      }
    }
    ans = (ans * dp[po][k]) % MOD;
  }
  cout << ans << "\n";
  return 0;
}
