#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define REP(i,a,b) for(ll i=(a);i<(b);++i)
#define REPREV(i,a,b) for(ll i=(b)-1;i>=(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

ll __fact[] = {1,682498929,491101308,76479948,723816384,67347853,27368307,625544428,199888908,888050723,927880474,281863274,661224977,623534362,970055531,261384175,195888993,66404266,547665832,109838563,933245637,724691727,368925948,268838846,136026497,112390913,135498044,217544623,419363534,500780548,668123525,128487469,30977140,522049725,309058615,386027524,189239124,148528617,940567523,917084264,429277690,996164327,358655417,568392357,780072518,462639908,275105629,909210595,99199382,703397904,733333339,97830135,608823837,256141983,141827977,696628828,637939935,811575797,848924691,131772368,724464507,272814771,326159309,456152084,903466878,92255682,769795511,373745190,606241871,825871994,957939114,435887178,852304035,663307737,375297772,217598709,624148346,671734977,624500515,748510389,203191898,423951674,629786193,672850561,814362881,823845496,116667533,256473217,627655552,245795606,586445753,172114298,193781724,778983779,83868974,315103615,965785236,492741665,377329025,847549272,698611116};

ll getfact(ll x){
  ll r = x/10000000ll;
  ll ret = __fact[r];
  for(ll i = r*10000000ll;i<=x;i++){
    ret *= i;
    ret %= MOD;
  }
  return ret;
}

ll mdpow(ll a,ll b){
  ll r = 1ll;
  while(b){
    if(b&1)r=r*a%MOD;
    a=a*a%MOD;
    b>>=1;
  }
  return r;
}

ll inv(ll x){
  return mdpow(x,MOD-2);
}

ll h,w,k;

// 解説を読みました！！！！！！！！！！！！！！
// ポリアの数え上げ定理初耳でした！！！！！！！！！！！！

int main(){
  scanf("%lld%lld%lld",&h,&w,&k);
  // 全パターン K^(H*W)
  // DEBUG(getfact(830252521));
  vl dh, dw;
  vl th,tw;
  for(ll i=1;i*i<=h;i++){
    if(h%i!=0)continue;
    dh.push_back(i);
    if(h/i!=i)dh.push_back(h/i);
  }
  sort(ALL(dh));
  th.assign(dh.size(),0);
  REPREV(i,0,dh.size()){
    th[i] = h/dh[i];
    REP(j,i+1,dh.size()){
      if(dh[j]%dh[i]==0){
        th[i] -= th[j];
      }
    }
  }
  for(ll i=1;i*i<=w;i++){
    if(w%i!=0)continue;
    dw.push_back(i);
    if(w/i!=i)dw.push_back(w/i);
  }
  sort(ALL(dw));
  tw.assign(dw.size(),0);
  REPREV(i,0,dw.size()){
    tw[i] = w/dw[i];
    REP(j,i+1,dw.size()){
      if(dw[j]%dw[i]==0){
        tw[i] -= tw[j];
      }
    }
  }
  ll ans = 0;
  REP(i,0,dh.size())REP(j,0,dw.size()){
    ll kata = w*h/((h/dh[i])*(w/dw[j])/__gcd(h/dh[i],w/dw[j]));
    kata %= MOD-1;
    ans += th[i]*tw[j]%MOD*mdpow(k,kata)%MOD;
    ans %= MOD;
  }
  ans *= inv(h);
  ans %= MOD;
  ans *= inv(w);
  ans %= MOD;
  printf("%lld\n",ans);
  return 0;
}