#include <bits/stdc++.h>
using namespace std;
vector<long long int> inv(70);
long long int pow(long long int x, long long int y, long long int m) {
  if (y == 0) return 1;
  long long int p = pow(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
long long int modInverse(long long int a,
                         long long int m = (long long int)(1e9 + 7)) {
  return pow(a, m - 2, m);
}
long long int Calc(long long int n, long long int power, long long int k) {
  vector<vector<long long int>> dp(k + 1, vector<long long int>(power + 1, 0));
  dp[0][power] = 1;
  for (int i = 1; i <= k; i++) {
    for (int j = power; j >= 0; j--) {
      long long int x = 0;
      for (int kk = j; kk <= power; kk++) {
        x = (x + dp[i - 1][kk] * inv[kk + 1]) % (long long int)(1e9 + 7);
      }
      dp[i][j] = x;
    }
  }
  long long int ans = 0;
  for (int j = 0; j <= power; j++) {
    ans = (ans + dp[k][j] * pow(n, j, (long long int)(1e9 + 7))) %
          (long long int)(1e9 + 7);
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long int n, k;
  cin >> n >> k;
  for (long long int i = 1; i < 70; i++) {
    inv[i] = modInverse(i);
  }
  long long int ans = 1;
  long long int sqrtn = sqrt(n);
  for (long long int i = 2; i <= sqrtn; i++) {
    if (n % i == 0) {
      int cnt = 0;
      while (n % i == 0) {
        cnt++;
        n /= i;
      }
      ans = (ans * Calc(i, cnt, k)) % (long long int)(1e9 + 7);
    }
  }
  if (n > 1) {
    ans = (ans * Calc(n, 1, k)) % (long long int)(1e9 + 7);
  }
  cout << ans;
  return 0;
}
