#include <bits/stdc++.h>
using namespace std;

long long N,K;
constexpr int mod = 1000000007;
long long f1[2000001],f2[2000001],sum[1000001];

long long modpow(long long a,long long b) {
    long long ans = 1;
    while(b) {
        if(b & 1) {
            (ans *= a) %= mod;
        }
        (a *= a) %= mod;
        b /= 2;
    }
    return ans;
}

long long com(long long n,long long k) {
    return f2[n-K+1]*modpow(f1[k],mod-2)%mod;
}

int main() {
    cin >> N >> K;
    map<long long,int>tmp;
    for(long long i = 2; i*i <= N; i++) {
        while (N%i == 0) {
            N /= i;
            tmp[i]++;
        }
    }
    if(N > 1) {
        tmp[N]++;
    }
    f1[1] = 1;
    for(long long i = 2; i <= 2000000; i++) {
        f1[i] = f1[i-1]*i%mod;
    }
    f2[1] = K%mod;
    for(long long i = 2; i <= 2000000; i++) {
        f2[i] = f2[i-1]*((K+i-1)%mod)%mod;
    }
    sum[0] = 1;
    for(long long i = 1; i <= 1000000; i++) {
        sum[i] = sum[i-1]+com(K+i-1,i);
        sum[i] %= mod;
    }
    long long ans = 1;
    for(auto x:tmp) {
        ans *= sum[x.second];
        ans %= mod;
    }
    cout << ans << endl;
}