#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}

template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;

using ll = long long;

mint ex(mint x,ll p){
	mint a = 1;
	while(p){
		if(p%2) a *= x;
		x *= x;
		p/=2;
	}
	return a;
}
ll gcd(ll x,ll y){
	if(y==0) return x;
	return gcd(y,x%y);
}

vector<ll> getds(ll x){
	vector<ll> res;
	for(ll i=1;i*i<=x;i++) if(x%i==0){
		res.pb(i);
		if(i*i!=x) res.pb(x/i);
	}
	return res;
}

map<ll,ll> memo;
ll tot(ll x){
	if(memo.count(x)) return memo[x];
	ll ox = x;
	ll res = x;
	vector<ll> ps;
	for(ll i=2;i*i<=x;i++) if(x%i==0){
		ps.pb(i);
		while(x%i==0) x/=i;
	}
	if(x>1) ps.pb(x);
	for(ll p:ps){
		res/=p;
		res*=(p-1);
	}
	return memo[ox] = res;
}

int main(){
	ll H,W,K;
	cin>>H>>W>>K;
	vector<ll> hs = getds(H);
	vector<ll> ws = getds(W);
	mint res = 0;
	for(ll h:hs) for(ll w:ws){
		mint num = tot(H/h)*tot(W/w);
		ll g = gcd(H*w,h*W);
		res += num * ex(K,g);
	}
	res /= H*W;
	cout<<res<<endl;
}