#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=1000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

long long extGCD(long long a,long long mod,long long &x,long long &y){
    if(mod==0){
        x=1;
        y=0;
        return a;
    }
    long long d=extGCD(mod,a%mod,y,x);
    y-=(a/mod)*x;
    return d;
}
long long invmod(long long a,long long mod){
    long long x,y;
    extGCD(a,mod,x,y);
    x%=mod;
    if(x<0)x+=mod;
    return x;
}

ll comb(ll k, ll m){
    ll res=1;
    ll b=1;
    REP(i,1,m+1){
        b=b*i%mod;
        res=(k+i)%mod*res%mod;
    }
    return res*invmod(b,mod)%mod;
}

signed main(){
    ll n,k;cin>>n>>k;
    vector<ll>d(MAX);
    REP(i,2,MAX){
        if(d[i]!=0)continue;
        ll k=1;
        while(i*k<MAX){
            if(d[k*i]==0)d[k*i]=i;
            k++;
        }
    }
    ll ans=1;
    REP(i,1,sqrt(n)+1){
        if(d[i]==i&&n%i==0){
            ll cnt=0;
            while(n%i==0){
                n/=i;
                cnt++;
            }
            ans=ans*comb(k,cnt)%mod;
        }
    }
    if(n>1)ans=ans*comb(k,1)%mod;
    if(ans<0)ans+=mod;
    cout<<ans<<endl;
}