#include<bits/stdc++.h>

using namespace std;

#define int long long

using vi = vector<int>;

int p, k, t;

struct matrix {
    int x, y;
    vector<vi> v;

    matrix(int x, int y) : x(x), y(y) {
        v = vector(x + 1, vi(y + 1, 0));
    }

    void I() {
        assert(x == y);
        for (int i = 1; i <= x; i++)
            v[i][i] = 1;
        return;
    }

    friend matrix operator*(const matrix &a, const matrix &b) {
        assert(a.y == b.x);
        matrix ans(a.x, b.y);
        for (int i = 1; i <= a.x; i++)
            for (int j = 1; j <= b.y; j++)
                for (int k = 1; k <= a.y; k++)
                    ans.v[i][j] = (ans.v[i][j] + a.v[i][k] * b.v[k][j] % p) % p;
        return ans;
    }

    friend matrix operator^(matrix x, int y) {
        assert(x.x == x.y);
        matrix ans(x.x, x.y);
        ans.I();
        while (y) {
            if (y & 1) ans = ans * x;
            x = x * x, y >>= 1;
        }
        return ans;
    }
};

int32_t main() {
    cin >> p >> k >> t;

    matrix a(2, 1), b(2, 2);
    a.v[1][1] = p - k, a.v[1][2] = 1;
    b.v[1][1] = -k, b.v[1][2] = p;
    b.v[2][1] = 0, b.v[2][2] = 1;

    auto res = (b ^ ( t - 1 )) * a;
    cout << res.v[1][1] << "\n";

    return 0;
}