#include <bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
const int N = 1e5 + 10, M = 1e6 + 10;
/*
int cal(int p, int k, int t){
    int res = 0;
    for(int i = 0; i < (1 << (p - 1)); i++){
        if(__builtin_popcount(i) != t || ((1 << (k - 1)) & i)) continue;
        int x = i, s = 1ll;
        for(int j = 1; j < p; j++){
            if(x & 1) s = s * j % p;
            x >>= 1;
        }
        res = (res + s) % p;
    }
    return res % p;
}
void solve(){
    int p = 11, k, t;
    for(k = 1; k < p; k++){
        for(t = 1; t < p; t++){
            cout << p << ' ' << k << ' ' << t << ' ' << cal(p, k, t) << '\n';
        }
    }
}
*/
int qpow(int a, int b, int mod){
    int res = 1;
    while(b){
        if(b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
void solve(){
    int p, k, t;
    cin >> p >> k >> t;
    cout << qpow(p - k, t, p) << '\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    //cin >> T;
    while(T--) solve();
    return 0;
}