#include #define _overload(_1,_2,_3,name,...) name #define _rep(i,n) _range(i,0,n) #define _range(i,a,b) for(int i=int(a);i=int(b);--i) #define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__) #define _all(arg) begin(arg),end(arg) #define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg)) #define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary) #define clr(a,b) memset((a),(b),sizeof(a)) #define bit(n) (1LL<<(n)) #define popcount(n) (__builtin_popcountll(n)) using namespace std; templatebool chmax(T &a, const T &b) { return (abool chmin(T &a, const T &b) { return (bEPS=1e-8 [-10000,10000]->EPS=1e-7 inline int sgn(const R& r){return(r > EPS)-(r < -EPS);} inline R sq(R x){return sqrt(max(x,0.0));} const int dx[8]={1,0,-1,0,1,-1,-1,1}; const int dy[8]={0,1,0,-1,1,1,-1,-1}; // Problem Specific Parameter: const ll mod=1000000007LL; inline ll power(ll a,ll n){ ll b=1LL; while(n){ if(n&1) b=b*a%mod; a=a*a%mod; n>>=1; } return b; } inline ll lcm(ll a,ll b){return a/__gcd(a,b)*b;} auto calc(ll n){ vector f; ll all=n; for(ll i=2LL;i*i<=all;++i){ if(all%i) continue; f.push_back(i); while(all%i==0) all/=i; } if(all!=1) f.push_back(all); const int m=f.size(); map ret; for(ll i=1LL;i*i<=n;++i){ if(n%i) continue; { ll cur=0LL; rep(mask,1<> h >> w >> k; map hf=calc(h); map wf=calc(w); map table; for(auto &i:hf){ for(auto &j:wf){ const int arg=lcm(i.first,j.first); table[arg]+=1LL*i.second*j.second%mod; table[arg]%=mod; } } ll sum=0LL; for(auto &i:table){ sum+=1LL*power(k,h*w/i.first)*i.second%mod; sum%=mod; } const ll allinv=power(h*w%mod,mod-2); cout << sum*allinv%mod << endl; return 0; } /* w 1 h 2 1 2 2 // 繰り返しの回数 2 1 2 1 1 1 1 1 2 3 6 8 12 0 1 2 3 4 5 1 6 3 2 3 6 6 1 2 3 2 1 lcm(h/__gcd(a,h),w/__gcd(b,w)) */