#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mpow(ll a, ll n, ll m = 1e9 + 7) {
    ll ret = 1;
    while (n) {
        if (n % 2) {
            ret *= a;
            ret %= m;
        }
        a = (a * a) % m;
        n /= 2;
    }
    return ret;
}
int main () {
    ll N, K;
    ll m = 1e9 + 7;
    cin >> N >> K;
    ll cmb[66];
    cmb[0] = 1;
    for (int i = 1; i < 66; i ++) {
        cmb[i] *= (K + i);
        cmb[i] %= m;
        cmb[i] *= mpow(i, m - 2);
        cmb[i] %= m;
    }
    ll N_ = N;
    ll ans = 1;
    for (int i = 2; i * i <= N_; i ++) {
        if (N == 1) {
            break;
        }
        if (N % i == 0) {
            int cnt = 0;
            while (N % i == 0) {
                cnt ++;
                N /= i;
            }
            ans *= cmb[cnt];
            ans %= m;
        }
    }
    if (N > 1) {
        cout << K + 1 << endl;
    } else {
        cout << ans << endl;
    }
}