// g++-13 6.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

//aのｂ乗をｃで割った余り
ll mpower(ll a,ll b,ll c){
  ll z;
  if(b==0){
    z=1;
    z%=c;
    return z;
  }
  if(b==1){
    z=a;
    z%=c;
    return z;
  }
  if(b%2==0){
    z=mpower(a,b/2,c);
    return (z*z)%c;
  }
  else{
    z=mpower(a,b-1,c);
    return (z*mpower(a,1,c))%c;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll p,k,t;cin>>p>>k>>t;
  ll ans=0;
  if(t%2==0){
    ans+=mpower(k,t,p);
  }
  else{
    ans-=mpower(k,t,p);
    if(ans<0)ans+=p;
  }

  cout<<ans<<endl;
}