#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
long long n, k;
long long inv[60];
long long dp[60][10001];
long long solve(int n, int k, long long x) {
  x %= MOD;
  memset(dp, 0, sizeof(dp));
  dp[n][0] = 1;
  for (int i = n; i >= 0; --i)
    for (int j = 1; j <= k; ++j) {
      if (i < n) dp[i][j] = dp[i + 1][j];
      if (j > 0) dp[i][j] += dp[i][j - 1] * inv[i + 1] % MOD;
      if (dp[i][j] >= MOD) dp[i][j] -= MOD;
    }
  long long res = 0;
  long long cur = 1;
  for (int i = 0; i <= n; ++i) {
    res += cur * dp[i][k] % MOD;
    if (res >= MOD) res -= MOD;
    cur = cur * x % MOD;
  }
  return res;
}
long long calc(int a, int b) {
  if (b == 0) return 1;
  if (b & 1) return calc(a, b - 1) * a % MOD;
  long long tmp = calc(a, b / 2);
  return tmp * tmp % MOD;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (int i = 1; i < 60; ++i) inv[i] = calc(i, MOD - 2);
  cin >> n >> k;
  long long res = 1;
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      int cnt = 0;
      while (n % i == 0) {
        n /= i;
        ++cnt;
      }
      res = res * solve(cnt, k, i) % MOD;
    }
  }
  if (n != 1) {
    res = res * solve(1, k, n) % MOD;
  }
  cout << res << endl;
  return 0;
}
