#include <bits/stdc++.h>
const long long int mod = 1e9 + 7, N = 10005;
long long int dp[N][60] = {0}, n, k, inv[60], ans = 1;
long long int pow(long long int a, long long int v) {
  long long int res = 1;
  while (v) {
    if (v & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    v >>= 1;
  }
  return res;
}
void cal(long long int a, long long int v) {
  memset(dp, 0, sizeof(dp));
  dp[0][v] = 1;
  for (int i = 0; i < k; i++)
    for (int j = v; j >= 0; j--)
      for (int x = 0; x <= j; x++) {
        dp[i + 1][x] = (dp[i + 1][x] + dp[i][j] * inv[j + 1]) % mod;
      }
  long long int t = 1, res = 0;
  for (int i = 0; i <= v; i++) {
    res = (res + t * dp[k][i]) % mod;
    t = (t * a) % mod;
  }
  ans = (ans * res) % mod;
}
int main() {
  scanf("%I64d%I64d", &n, &k);
  for (long long int i = 1; i < 60; i++) inv[i] = pow(i, mod - 2);
  for (int i = 2; i <= n && i < 33000000; i++)
    if (n % i == 0) {
      int v = 0;
      while (n % i == 0) {
        v++;
        n /= i;
      }
      cal(i, v);
    }
  if (n != 1) cal(n, 1);
  printf("%I64d", ans);
}
