#include <bits/stdc++.h>
using namespace std;
long long binpow(long long n, int u) {
  long long ans = 1;
  n = n % 1000000007;
  while (u) {
    if (u & 1) {
      ans = (ans * n) % 1000000007;
      u--;
    } else {
      n = (n * n) % 1000000007;
      u >>= 1;
    }
  }
  return ans;
}
class MaxSegmentTree {
  long long* tree;

 public:
  MaxSegmentTree(long long n) {
    tree = new long long[4 * n + 4];
    build(1, 1, n + 1);
  }
  void build(long long v, long long tl, long long tr) {
    if (tl == tr - 1) {
      tree[v] = -(1ll << 60);
      return;
    }
    long long m = (tl + tr) >> 1;
    build(v << 1, tl, m);
    build(v << 1 | 1, m, tr);
    tree[v] = -(1ll << 60);
  }
  void update(int v, int tl, int tr, int pos, long long val) {
    if (tl == tr - 1) {
      tree[v] = val;
      return;
    }
    int m = (tl + tr) >> 1;
    if (m > pos)
      update(v << 1, tl, m, pos, val);
    else
      update(v << 1 | 1, m, tr, pos, val);
    tree[v] = max(tree[v << 1], tree[v << 1 | 1]);
  }
  int getLeftGreater(int v, int tl, int tr, long long val) {
    if (tree[v] < val) return -1;
    if (tl == tr - 1) return tl;
    int m = (tl + tr) >> 1;
    if (tree[v << 1] >= val) return getLeftGreater(v << 1, tl, m, val);
    return getLeftGreater(v << 1 | 1, m, tr, val);
  }
  int getRightGreater(int v, int tl, int tr, long long val) {
    if (tree[v] <= val) return -1;
    if (tl == tr - 1) return tl;
    int m = (tl + tr) >> 1;
    if (tree[v << 1 | 1] > val) return getRightGreater(v << 1 | 1, m, tr, val);
    return getRightGreater(v << 1, tl, m, val);
  }
};
class SumSegmentTree {
  long long n;
  long long *tree, *zap;

 public:
  SumSegmentTree(long long n) : n{n} {
    tree = new long long[4 * n + 4];
    zap = new long long[4 * n + 4];
    build(1, 1, n + 1);
  }
  void build(long long v, long long tl, long long tr) {
    if (tl == tr - 1) {
      tree[v] = 0;
      zap[v] = 0;
      return;
    }
    long long m = (tl + tr) >> 1;
    build(v << 1, tl, m);
    build(v << 1 | 1, m, tr);
    tree[v] = 0;
    zap[v] = 0;
  }
  void push(long long v, long long tl, long long tr) {
    if (zap[v] == 0) return;
    tree[v] += zap[v] * (tr - tl);
    if (tl < tr - 1) {
      zap[v << 1] += zap[v];
      zap[v << 1 | 1] += zap[v];
    }
    zap[v] = 0;
  }
  void update(long long v, long long tl, long long tr, long long l, long long r,
              long long val) {
    push(v, tl, tr);
    if (tl >= r || tr <= l) return;
    if (tl >= l && tr <= r) {
      zap[v] += val;
      push(v, tl, tr);
      return;
    }
    long long m = (tl + tr) >> 1;
    update(v << 1, tl, m, l, r, val);
    update(v << 1 | 1, m, tr, l, r, val);
    tree[v] = tree[v << 1] + tree[v << 1 | 1];
  }
  void print(long long v, long long tl, long long tr) {
    push(v, tl, tr);
    if (tl == tr - 1) {
      if (tl != 1 && tl != n) cout << tree[v] << " ";
      return;
    }
    long long m = (tl + tr) >> 1;
    print(v << 1, tl, m);
    print(v << 1 | 1, m, tr);
  }
};
void solve() {
  long long n, k;
  cin >> n >> k;
  map<long long, int> pr;
  long long nn = n;
  for (long long i = 2; i * i <= nn; i++) {
    if (nn % i == 0) {
      int u = 0;
      while (nn % i == 0) {
        nn /= i;
        u++;
      }
      pr[i] = u;
    }
  }
  if (nn > 1) pr[nn] = 1;
  long long ans = 1;
  for (auto x : pr) {
    int al = x.second;
    long long p = x.first;
    long long dp[al + 1][k + 1];
    for (int i = 1; i <= k; i++) dp[0][i] = 1;
    for (int i = 1; i <= al; i++)
      dp[i][1] = ((binpow(p, i + 1) - 1) *
                  binpow((i + 1ll) * (p - 1), 1000000007 - 2)) %
                 1000000007;
    for (int j = 2; j <= k; j++) {
      for (int i = 1; i <= al; i++) {
        dp[i][j] = 0;
        for (int z = 0; z <= i; z++)
          dp[i][j] = (dp[i][j] + dp[z][j - 1]) % 1000000007;
        dp[i][j] = (dp[i][j] * binpow(i + 1, 1000000007 - 2)) % 1000000007;
      }
    }
    ans = (ans * dp[al][k]) % 1000000007;
    ans = (ans + 1000000007) % 1000000007;
  }
  cout << ans << endl;
}
int main(int argc, char const* argv[]) {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
