#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
//    vector<int> primes = {2, 3, 5, 7, 11};
//    for (int p : primes) {
//        for (int k = 1; k <= p-1; ++k) {
//            for (int t = 1; t <= p-2; ++t) {
//                ll sum = 0;
//                auto dfs = [&](auto dfs, int i, int cn, ll pro) -> void {
//                    if (i == p) {
//                        if (cn == t) {
//                            sum += pro;
//                            sum %= p;
//                        }
//                        return;
//                    }
//                    dfs(dfs, i+1, cn, pro);
//                    if (i != k) dfs(dfs, i+1, cn+1, pro*i%p);
//                };
//                dfs(dfs, 1, 0, 1);
//                cout << p << " " << k << " " << t << " " << sum << endl;
//            }
//        }
//    }
    ll p,k,t; cin >> p >> k >> t;
    ll res = 0;
    if (t == p-1) res = p-1;
    ll x = (res-k)%p;
    if (t == 1) {
        res = x;
    }
    else {
        if (t%2 == 0) res -= modpow(k, t-1, p)*x;
        else res += modpow(k, t-1, p)*x;
    }
    res %= p;
    if (res < 0) res += p;
    cout << res << endl;
}


/*
 * t = 1 x
 * t = 2 -kx
 * t = 3 k^2x - kx
 */

//ll p,k,t; cin >> p >> k >> t;
//ll res = 0;
//if (t == p-1) res = p-1;
//
//if (t == 1) {
//res -= k;
//res %= p;
//if (res < 0) res += p;
//}
//
//cout << res << endl;