#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <array>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

constexpr ll mod = 1e9+7;

ll mod_pow(ll a,ll b){
    a%=mod;
    if(b==0)return 1;
    if(b==1)return a;
    ll res=mod_pow(a,b/2)%mod;
    res*=res; res%=mod;
    if(b%2)res*=a;
    return res%mod;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,k; cin >> n >> k;
    // binom(n-1+k,k)
    auto comb=[&](ll n,ll k)->ll{
        ll res = 1;
        for(ll i=1;i<=k;i++){
            res *= (n+1-i)%mod;
            res %= mod;
            res *= mod_pow(i,mod-2);
            res %= mod;
        }
        return res;
    };
    ll res = 1;
    for(ll i=2;i*i<=n;i++){
        if(n%i==0){
            int cnt=0;
            while(n%i==0){
                n/=i;
                cnt++;
            }
            ll sum = 1;
            for(int j=1;j<=cnt;j++){
                sum += comb(k-1+j, j);
                sum %= mod;
            }
            res *= sum;
            res %= mod;
        }
    }
    if(n > 1){
        res *= (1+comb(k, 1));
        res %= mod;
    }
    cout << res << endl;
}