#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; ll K; const ll mo=1000000007; ll modpow(ll a, ll n,ll mo=1000000007) { ll r=1;a%=mo; while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1; return r; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>K; map M; for(i=2;i<=N;i++) { while(N%i==0) { M[i]++; N/=i; } } FOR(i,200100) if(K) { if(i==99&&K%2==0) continue; K--; map M2; FORR2(a2,b,M) { ll a=a2; a++; while(a%2==0) { (M2[2]+=b)%=mo-1; a/=2; } if(a>1) (M2[a]+=b)%=mo-1; } swap(M,M2); } ll ret=1; K/=2; FORR2(a,b,M) { b=b*modpow(2,K,mo-1)%(mo-1); ret=ret*modpow(a,b)%mo; } cout<