#include <bits/stdc++.h>
using namespace std;
const long long mo = 1e9 + 7;
long long fpow(long long a, long long b, long long c) {
  a %= c;
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a % c;
    b >>= 1;
    a = a * a % c;
  }
  return ans;
}
long long inv[105];
long long dp[50][10005];
long long E(long long p, long long n, long long k) {
  for (long long i = 0; i <= n; i++) dp[i][0] = i == n;
  for (long long t = 1; t <= k; t++) {
    for (long long i = 0; i <= n; i++) {
      dp[i][t] = 0;
      for (long long j = i; j <= n; j++) {
        dp[i][t] = (dp[i][t] + dp[j][t - 1] * inv[j + 1]) % mo;
      }
    }
  }
  long long ans = 0;
  for (long long i = 0; i <= n; i++)
    ans = (ans + fpow(p, i, mo) * dp[i][k]) % mo;
  return ans;
}
long long p[105], t[105], tot = 0;
int main() {
  long long N, K;
  inv[1] = 1;
  for (int i = 2; i < 100; i++) inv[i] = (mo - mo / i) * inv[mo % i] % mo;
  cin >> N >> K;
  long long temp = N;
  for (long long i = 2; i * i <= N; i++)
    if (temp % i == 0) {
      tot++;
      p[tot] = i;
      t[tot] = 0;
      while (temp % i == 0) temp /= i, t[tot]++;
    }
  if (temp > 1) p[++tot] = temp, t[tot] = 1;
  long long ans = 1;
  for (long long i = 1; i <= tot; i++) ans = ans * E(p[i], t[i], K) % mo;
  cout << ans << endl;
  return 0;
}
