#include <bits/stdc++.h>
using namespace std;
long long int inv[105];
long long int DP[10005][105];
long long int modPowIter(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) ans = (ans * a) % 1000000007;
    a = (a * a) % 1000000007;
    b /= 2;
  }
  return ans;
}
long long int solve(long long int n, long long int k, long long int p,
                    int pow) {
  for (int i = 0; i < 10005; ++i)
    for (int j = 0; j < 105; ++j) DP[i][j] = 0;
  DP[0][pow] = 1;
  for (int j = 0; j <= pow; ++j) DP[1][j] = inv[pow + 1];
  for (int i = 2; i <= k; ++i) {
    for (int j = 0; j <= pow; j++) {
      for (int s = j; s <= pow; ++s)
        DP[i][j] =
            (DP[i][j] + (DP[i - 1][s] * inv[s + 1]) % 1000000007) % 1000000007;
    }
  }
  long long int ans = 0;
  for (int j = 0; j <= pow; j++)
    ans = (ans + (modPowIter(p, j) * DP[k][j])) % 1000000007;
  return ans;
}
int main() {
  long long int n, k;
  scanf("%lld", &n), scanf("%lld", &k);
  for (int i = 1; i <= 101; ++i) inv[i] = modPowIter(i, 1000000007 - 2);
  long long int ans = 1;
  for (long long int p = 2; p * p <= n; ++p) {
    if (n % p == 0) {
      int cnt = 0;
      while (n % p == 0) {
        n /= p;
        cnt++;
      }
      ans = (ans * solve(n, k, p, cnt)) % 1000000007;
    }
  }
  if (n != 1) {
    ans = (ans * solve(n, k, n, 1)) % 1000000007;
  }
  printf("%lld\n", ans);
  return 0;
}
