#include <bits/stdc++.h>

using std::cin;
using std::cout;
#define int long long
int p, k, t;

inline int quick_pow(int x, int k)
{
	int res = 1;
	while (k)
	{
		if (k & 1)
			res = 1ll * res * x % p;
		x = 1ll * x * x % p;
		k >>= 1;
	}
	return res;
}

signed main()
{
	cin >> p >> k >> t;
	if (t == p - 2)	
		cout << 1ll * (p - 1) * quick_pow(k, p - 2) % p << '\n';
	else 
		cout << (1ll * p * (p - 1) / 2 - k) % p * quick_pow(p - k, t - 1) % p << '\n'; 
}