1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #include<cmath>
 6 using namespace std;
 7 #define p 3214567
 8 #define maxn 200020
 9
10 int m,r,tot;
11 int prime[maxn],phi[maxn];
12 bool isprime[maxn];
13 long long n;
14
15 int power(int a,long long k){
16     if (k==0) return 1;
17     if (k==1) return a%p;
18     int x=power(a,k/2),ans=1ll*x*x%p;
19     if (k&1) ans=1ll*a*ans%p;
20     return ans;
21 }
22
23 int fphi(int x){
24     int ans=x;
25     for (int i=2;i*i<=x;i++)
26         if (x%i==0){
27             ans=ans-ans/i;
28             while (x%i==0) x/=i;
29         }
30     if (x!=1) ans=ans-ans/x;
31     return ans;
32 }
33
34 int main(){
35     scanf("%lld%d%d",&n,&m,&r);tot=0,memset(isprime,1,sizeof(isprime)),phi[1]=1;
36     for (int i=2;i<maxn;i++){
37         if (isprime[i]) prime[++tot]=i,phi[i]=i-1;
38         for (int j=1;j<=tot && i*prime[j]<maxn;j++){
39             isprime[i*prime[j]]=0;
40             if (i%prime[j]==0){
41                 phi[i*prime[j]]=phi[i]*prime[j];
42                 break;
43             }
44             phi[i*prime[j]]=phi[i]*(prime[j]-1);
45         }
46     }
47     int ans=0;
48     for (int i=1;i*i<=m;i++)
49         if (m%i==0){
50             ans=(ans+1ll*power(r,i)*fphi(m/i)%p)%p;
51             if (i*i!=m) ans=(ans+1ll*power(r,m/i)*phi[i]%p)%p;
52         }
53     ans=1LL*ans*power(m,p-2)%p;
54     int t=(1ll*power(ans-1,n)+(n&1?1-ans:ans-1))%p;
55     printf("%d\n",(t+p)%p);
56     return 0;
57 }