#include <bits/stdc++.h>

#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 rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;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;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9; // [-1000,1000]->EPS=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<R>(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<ll> 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<ll,ll> ret;

	for(ll i=1LL;i*i<=n;++i){
		if(n%i) continue;
		{
			ll cur=0LL;
			rep(mask,1<<m){
				ll tar=i;
				rep(j,m) if(mask&(1<<j)) tar*=f[j];
				if(n%tar!=0) continue;

				if(__builtin_popcount(mask)&1)
					cur=(cur+mod-n/tar)%mod;
				else
					cur=(cur+n/tar)%mod;
			}
			ret[n/i]=cur;
		}
		if(i==n/i) continue;
		{
			ll cur=0LL;
			rep(mask,1<<m){
				ll tar=n/i;
				rep(j,m) if(mask&(1<<j)) tar*=f[j];
				if(n%tar!=0) continue;
				 
				if(__builtin_popcount(mask)&1)
					cur=(cur+mod-n/tar)%mod;
				else
					cur=(cur+n/tar)%mod;
			}
			ret[i]=cur;
		}
	}	

	//cout << n << endl;
	//for(auto &it:ret) cout << it.first << " " << it.second << endl;

	return ret;
}


int main(void){
	ll h,w,k;
	cin >> h >> w >> k;

	map<ll,ll> hf=calc(h);
	map<ll,ll> wf=calc(w);
	map<ll,ll> 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))
*/