#include <bits/stdc++.h>
using namespace std;
const int K = 1e4 + 10;
const int L = 50 + 10;
const long long mod = 1e9 + 7;
long long Pow(long long a, long long b) {
  if (b == 0) return 1;
  long long res = Pow(a, b / 2);
  res = res * res % mod;
  if (b & 1) res = res * a % mod;
  return res;
}
long long dp[K][L], inv[L];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  long long E = 1, m = n;
  for (int i = 0; i < L; i++) inv[i] = Pow(i, mod - 2);
  for (long long d = 2; d * d <= m; d++) {
    if (n % d) continue;
    long long t = 0;
    while (n % d == 0) n /= d, t++;
    for (int i = 0; i <= k; i++)
      for (int j = 0; j <= t; j++) dp[i][j] = 0;
    dp[0][t] = 1;
    for (int i = 1; i <= k; i++)
      for (int j = 0; j <= t; j++)
        for (int r = j; r <= t; r++)
          dp[i][j] = (dp[i][j] + inv[r + 1] * dp[i - 1][r] % mod) % mod;
    long long res = 0;
    for (int j = 0; j <= t; j++) res = (res + dp[k][j] * Pow(d, j) % mod) % mod;
    E = E * res % mod;
  }
  if (1 < n) {
    memset(dp, 0, sizeof dp);
    dp[0][1] = 1;
    for (int i = 1; i <= k; i++)
      for (int j = 0; j <= 1; j++)
        for (int r = j; r <= 1; r++)
          dp[i][j] = (dp[i][j] + inv[r + 1] * dp[i - 1][r] % mod) % mod;
    long long res = 0;
    for (int j = 0; j <= 1; j++) res = (res + dp[k][j] * Pow(n, j) % mod) % mod;
    E = E * res % mod;
  }
  cout << E;
  return 0;
}
