#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template <typename H, typename... T> 
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

int MOD = 998244353;
struct mint {
    int x;
    mint(): x(0) {}
    mint(int _x): x(_x % MOD < 0 ? _x % MOD + MOD : _x % MOD) {}
    void operator+=(mint rhs) { x += rhs.x; if(x>=MOD) x-=MOD; }
    void operator-=(mint rhs) { x -= rhs.x; if(x<0) x+=MOD; }
    void operator*=(mint rhs) { x = x * rhs.x % MOD; }
    void operator/=(mint rhs) { *this *= rhs.inv(); }
    mint operator+(mint rhs) { mint y = *this; y += rhs; return y; }
    mint operator-(mint rhs) { mint y = *this; y -= rhs; return y; }
    mint operator*(mint rhs) { mint y = *this; y *= rhs; return y; }
    mint operator/(mint rhs) { mint y = *this; y /= rhs; return y; }
    mint inv() { return this->pow(MOD-2); }
    mint pow(int e) {
        mint res = 1;
        for(mint p = *this; e > 0; p *= p, e /= 2) if(e & 1)
            res *= p;
        return res;
    }
};

void solve() {
    int p, k, t; cin >> p >> k >> t;
    MOD = p;
    // mint ans = 0;
    // for(int msk=0;msk<(1<<(p-1));msk++) if(__builtin_popcount(msk) == t && (msk >> (k - 1) & 1) == 0) {
    //     mint prod = 1;
    //     for(int v=0;v<p-1;v++) if(msk >> v & 1) {
    //         prod *= v + 1;
    //     }
    //     ans += prod;
    // }
    mint ans = mint (-k).pow (t);
    cout << ans.x << "\n";
    // cout << ans.x << '\n';
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    solve();
}