#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define ull unsigned long long 
#define sz(a) ((int) a.size())
#define vi vector<int>
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 1e7 + 7; 
int mod;
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}

inline int calc(int p, int k, int t) {
	int sum = 0;
	L(i, 1, (1 << (p - 2)) - 1) if(__builtin_popcount(i) == t) {
		int prd = 1, bt = i;
		L(i, 1, p - 1) if(i != k) {
			if(bt & 1) prd = (ll) prd * i % p;
			bt >>= 1;
		}
		(sum += prd) %= p;
	}
	return sum;
}

int p, k, t;

int main () { 
	ios :: sync_with_stdio(false);
	cin.tie (0); cout.tie (0);
	cin >> p >> k >> t;
	mod = p;
	cout << qpow(p - k, t) % p << '\n';
//	cin >> p;
//	mod = p;
//	L(k, 1, p - 1) {
//		L(t, 1, p - 2) cout << calc(p, k, t) << ' ';
//		cout << endl;	
//		L(t, 1, p - 2) cout << qpow(p - k, t) << ' ';
//		cout << endl;	
//		cout << endl;
//	} 
	return 0;
}