#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint1000000007;

int main()
{
    ll n, k; cin>>n>>k;
    vector<int> v;
    for(ll i=2; i*i<=n; i++){
        if(n%i==0){
            int e=0;
            while(n%i==0){
                n/=i;
                e++;
            }
            v.push_back(e);
        }
    }
    if(n>1) v.push_back(1);
    mint ans=1;
    for(auto e:v){
        for(int i=1; i<=e; i++){
            ans/=mint(i);
            ans*=mint(k+e+1-i);
        }
    }
    cout<<ans.val()<<endl;
    return 0;
}