//Author: Kevin5307
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll ksm(ll a,ll b,ll mod)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll p,k,t;
	cin>>p>>k>>t;
	if(t==p-2)
	{
		cout<<(p-1)*ksm(k,p-2,p)%p<<endl;
		return 0;
	}
//	ll val=(p-k);
//	ll val2=(ksm(val,t,p)+p-1)*ksm(val-1,p-2,p)%p;
//	if(val==1)
//		val2=(t%2);
//	val2=val2*(p-1)%p;
	ll val2=0;
	if(t%2)
		val2=(val2+p-ksm(k,t,p))%p;
	else
		val2=(val2+ksm(k,t,p))%p;
	cout<<val2<<endl;
	return 0;
}