#include <bits/stdc++.h>
//#include <vector>
using namespace std;

void solve() {

}
#define  int long long
int p,k,t;
int mod;
int qpow(int a,int b)
{
    int res=1;
    while(b)
    {
        if(b&1) res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res;
}
signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>p>>k>>t;
    mod=p;
    int w=(1+p-1)*(p-1)%mod*qpow(2,mod-2)%mod;
    w=((w-k)%mod+mod)%mod;
    w=w*qpow(k,t-1)%mod;
    if(t%2==0){
//        w=-w;
        w=(-w%mod+mod)%mod;
    }
    cout<<w%mod;
}
//1 2 3 4 5 6


//1 2 3 4 5
//1 2 3 4 6
//1 2 3 5 6
//1 2 4 5 6
//1 3 4 5 6
//2 3 4 5 6
//t=2
//p=7
//k(0-k(1+3+4+5+6))