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

namespace modint {

using i64 = int64_t;

template <int P> struct mint {
  private:
    constexpr mint power(mint x, int p) const {
        mint res = 1;
        while (p > 0) {
            if (p & 1) { res *= x; }
            x *= x;
            p >>= 1;
        }
        return res;
    }

  public:
    int x;
    constexpr mint() : x{} {}
    constexpr mint(i64 x) : x{norm(x % getMod())} {}
    static int Mod;
    constexpr static int getMod() {
        if (P > 0) {
            return P;
        } else {
            return Mod;
        }
    }
    constexpr static void setMod(int Mod_) { Mod = Mod_; }
    constexpr int norm(int x) const {
        if (x < 0) { x += getMod(); }
        if (x >= getMod()) { x -= getMod(); }
        return x;
    }
    constexpr int val() const { return x; }
    explicit constexpr operator int() const { return x; }
    constexpr mint operator-() const {
        mint res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr mint inv() const {
        assert(x != 0);
        return power(*this, getMod() - 2);
    }
    constexpr mint pow(int r) const { return power(*this, r); }
    constexpr mint &operator*=(mint rhs) & {
        x = 1LL * x * rhs.x % getMod();
        return *this;
    }
    constexpr mint &operator+=(mint rhs) & {
        x = norm(x + rhs.x);
        return *this;
    }
    constexpr mint &operator-=(mint rhs) & {
        x = norm(x - rhs.x);
        return *this;
    }
    constexpr mint &operator/=(mint rhs) & { return *this *= rhs.inv(); }
    friend constexpr mint operator*(mint lhs, mint rhs) {
        mint res = lhs;
        res *= rhs;
        return res;
    }
    friend constexpr mint operator+(mint lhs, mint rhs) {
        mint res = lhs;
        res += rhs;
        return res;
    }
    friend constexpr mint operator-(mint lhs, mint rhs) {
        mint res = lhs;
        res -= rhs;
        return res;
    }
    friend constexpr mint operator/(mint lhs, mint rhs) {
        mint res = lhs;
        res /= rhs;
        return res;
    }
    friend constexpr std::istream &operator>>(std::istream &is, mint &a) {
        i64 v;
        is >> v;
        a = mint(v);
        return is;
    }
    friend constexpr std::ostream &operator<<(std::ostream &os, const mint &a) {
        return os << a.val();
    }
    friend constexpr bool operator==(mint lhs, mint rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(mint lhs, mint rhs) {
        return lhs.val() != rhs.val();
    }
};

template <int P> int mint<P>::Mod{0};

template <typename Z> struct comb {
    std::vector<Z> fact, inv_fact;
    comb(int n) {
        fact.resize(n + 1, Z(1));
        inv_fact.resize(n + 1, Z(1));
        for (int i = 1; i <= n; i++) {
            fact[i] = fact[i - 1] * i;
        }
        inv_fact[n] = Z{1} / fact[n];
        for (int i = n - 1; i >= 0; i--) {
            inv_fact[i] = inv_fact[i + 1] * (i + 1);
        }
    }
    Z get(int n, int m) {
        if (n < m || m < 0) return 0;
        return fact[n] * inv_fact[m] * inv_fact[n - m];
    }
};
} // namespace modint

using Z = modint::mint<0>;
using C = modint::comb<Z>;

void solve() {
    i64 sign = 1;
    int k, t, p;
    cin >> p >> k >> t;
    if (t % 2 == 0) sign = -1;
    Z::setMod(p);
    Z ans = sign * ((i64)p * (p - 1) / 2 - k) % p;
    ans *= Z{k}.pow(t - 1);
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}