#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

const ll MOD = 1000000007;

std::vector<int> enum_prime(int n){     // containing n
    std::vector<int> res;
    if (n <= 1) return res;
    std::vector<bool> p(n + 1);
    fill(p.begin() + 2, p.end(), true);
    for(int i = 2; i <= n; i++){
        if(p[i]){
            res.push_back(i);
            for(int j = i * 2; j <= n; j += i) p[j] = false;
        }
    }
    return res;
}

long long modpow(long long x, long long n){
    long long  res = 1;
    long long mul = x;
    while(n){
        if(n % 2) res = res * mul % MOD;
        mul = mul * mul % MOD;
        n /= 2;
    }
    return res;
}

ll com(ll n, ll k, map<P, ll> &c){
    if(c.count(P(n, k))) return c[P(n, k)];
    ll res = 1;
    for(ll i = n; i > n - k; i--){
        res = res * (i % MOD) % MOD;
    }
    for(ll i = k; i > 0; i--){
        res = res * modpow(i, MOD - 2) % MOD;
    }
    return c[P(n, k)] = res;
}

int main()
{
    ll n, k;
    cin >> n >> k;
    vector<int> prime = enum_prime(1000000);
    map<int, int> mp;
    for(int p : prime){
        while(n % p == 0){
            mp[p]++;
            n /= p;
        }
    }
    if(n > 1) mp[n]++;
    ll ans = 1;
    map<P, ll> c;
    for(auto itr = mp.begin(); itr != mp.end(); itr++){
        ll s = 0;
        for(int i = 0; i <= itr->second; i++){
            s = (s + com(k + i - 1, i, c)) % MOD;
        }
        ans = ans * s % MOD;
    }
    cout << ans << endl;
}