#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ll N, K;
    cin >> N >> K;
    map<ll, ll> mp;
    for (ll i = 2; i * i <= N; i++) {
        while (N % i == 0) {
            mp[i]++;
            N /= i;
            //cout << N << " " << i << " " << mp[i] << endl;
        }
    }
    if (N > 1) mp[N]++;
    ll ans = 1, MOD = 1e9 + 7;
    for (auto i : mp) {
        //cout << i.first << " " << i.second << endl;
        ll y = i.second, x = K + y;
        rep(j, 0, y) {
            ans = (ans * (x - j)) % MOD;
            ans = (ans * mod_pow(j + 1, MOD - 2, MOD)) % MOD;
        }
    }
    cout << ans << endl;
}