#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

using mint = atcoder::modint1000000007;

mint pow(mint a, ll n) {
    assert(n >= 0);
	mint ans = 1;
	mint tmp = a;
	for (int i = 0; i <= 60; i++) {
		ll m = (ll)1 << i;
		if (m & n) {
		ans *= tmp;
		}
		tmp *= tmp;
	}
	return ans;
}


#define N_MAX 200002
mint inv[N_MAX],fac[N_MAX],finv[N_MAX];

void init(){
    fac[0]=1;fac[1]=1;
    finv[0]=1;finv[1]=1;
    inv[1]=1;
    for(int i=2;i<N_MAX;i++){
        inv[i]=mint(MOD)-inv[MOD%i]*(MOD/i);
        fac[i]=fac[i-1]*(ll) i;
        finv[i]=finv[i-1]*inv[i];
    }
}

mint comb(ll n, ll r){
    if(n-r < r) r = n-r;
    mint ans = 1;
    for(ll i = 1; i <= r; i++){
        ans *= mint(i).inv();
        ans *= n-i+1;
    }
    return ans;
}

using P = pair<ll, int>;

vector<P> factorize(ll n){
    ll m = n;
    vector<P> ans;
    for(ll p = 2; p*p <= n; p++){
        if(m%p == 0){
            int cnt = 0;
            while(m%p == 0){
                m /= p;
                cnt++;
            }
            ans.push_back(P(p, cnt));
        }
    }
    if(m != 1) ans.push_back(P(m, 1));
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    ll n, k; cin >> n >> k;
    auto v = factorize(n);
    int m = v.size();
    vector<mint> all(m), ng(m);
    mint ans = 1;
    for(int i = 0; i < m; i++){
        auto [c, x] = v[i];
        ans *= comb(k+x, x);
    }
    
    cout << ans.val() << endl;
}