#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const int N = 233, M = 1e4 + 7, mo = 1e9 + 7;
inline int fk(int x) { return x >= mo ? x - mo : x; }
long long n, m;
int p[N], cnt[N], inv[N], tot;
int f[M][N], Ans = 1;
int main() {
  n = read(), m = read();
  int T = sqrt(n);
  long long now = n;
  for (int i = 2; i <= T; i++) {
    if (now % i) continue;
    p[++tot] = i;
    while (now % i == 0) cnt[tot]++, now /= i;
  }
  if (now > 1) p[++tot] = now % mo, cnt[tot] = 1;
  inv[1] = 1;
  for (int i = 2; i < N; i++) inv[i] = 1ll * (mo - mo / i) * inv[mo % i] % mo;
  for (int i = 1; i <= tot; i++) {
    memset(f, 0, sizeof(f));
    f[0][cnt[i]] = 1;
    for (int j = 1; j <= m; j++) {
      f[j][cnt[i]] = 1ll * f[j - 1][cnt[i]] * inv[cnt[i] + 1] % mo;
      for (int k = cnt[i] - 1; k >= 0; k--)
        f[j][k] = fk(f[j][k + 1] + 1ll * f[j - 1][k] * inv[k + 1] % mo);
    }
    int pw = 1, res = 0;
    for (int j = 0; j <= cnt[i]; j++) {
      res = fk(res + 1ll * f[m][j] * pw % mo);
      pw = 1ll * pw * p[i] % mo;
    }
    Ans = 1ll * Ans * res % mo;
  }
  printf("%d\n", Ans);
  return 0;
}
