#include <bits/stdc++.h>
using namespace std;
const long long var = 1e9 + 7;
long long mypow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % var;
    a = (a * a) % var;
    b >>= 1;
  }
  return res;
}
long long ans = 1, dp[100], inv[100];
long long cal(long long pp, long long a, long long k) {
  dp[0] = 1;
  for (long long i = 1; i <= a; i++) {
    dp[i] = dp[i - 1] * pp % var;
  }
  for (long long t = 1; t <= k; t++) {
    for (long long i = 1; i <= a; i++) {
      dp[i] = (dp[i] + dp[i - 1]) % var;
    }
    for (long long i = 0; i <= a; i++) dp[i] = (dp[i] * inv[i + 1]) % var;
  }
  return dp[a];
}
struct obj {
  long long ind;
  long long k;
  long long cnt;
};
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  for (long long i = 1; i < 100; i++) inv[i] = mypow(i, var - 2);
  long long n, k;
  cin >> n >> k;
  vector<obj> pos;
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i) continue;
    long long cnt = 0;
    while (n % i == 0) {
      n /= i;
      cnt++;
    }
    pos.push_back({i, cnt, k});
    if (i * i > n) break;
  }
  for (long long i = 0; i < pos.size(); ++i) {
    ans = (ans * cal(pos[i].ind, pos[i].k, pos[i].cnt)) % var;
  }
  if (n != 1) {
    ans = ans * cal(n, 1, k) % var;
  }
  cout << ans << '\n';
  return 0;
}
