#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int const MAX = 60, mod = 1e9 + 7;
ll n;
int k;
ll a[MAX];
int b[MAX], sz;
int c[MAX], inv[MAX];
int ans = 1;
inline int pw(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for (int i = 2; 1ll * i * i <= n; i++) {
    if (n % i) continue;
    a[sz] = i;
    while (n % i == 0) {
      n /= i;
      b[sz]++;
    }
    sz++;
  }
  if (n > 1) {
    a[sz] = n;
    b[sz] = 1;
    sz++;
  }
  for (int j = 0; j < MAX; j++) inv[j] = pw(j, mod - 2);
  for (int i = 0; i < sz; i++) {
    memset(c, 0, sizeof c);
    c[b[i]] = 1;
    for (int _ = 0; _ < k; _++) {
      int cur = 0;
      for (int j = b[i]; j >= 0; j--) {
        cur = (cur + 1ll * c[j] * inv[j + 1]) % mod;
        c[j] = cur;
      }
    }
    int val = 0;
    a[i] %= mod;
    for (int j = 0, cur = 1; j <= b[i]; j++, cur = 1ll * cur * a[i] % mod) {
      val = (val + 1ll * c[j] * cur) % mod;
    }
    ans = 1ll * ans * val % mod;
  }
  cout << ans << '\n';
}
