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

struct barrett {
    unsigned int _m;
    unsigned long long im;
    explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}
    unsigned int umod() const { return _m; }
    unsigned int mul(unsigned int a, unsigned int b) const {
        unsigned long long z = a;
        z *= b;
        unsigned int v = (unsigned int)(z % _m);
        return v;
    }
};

long long pow_mod(long long x, long long n, int m) {
    assert(0 <= n && 1 <= m);
    if (m == 1) return 0;
    barrett bt(m);
    unsigned int r = 1, y = (unsigned int)(x % m);
    while (n) {
        if (n & 1) r = bt.mul(r, y);
        y = bt.mul(y, y);
        n >>= 1;
    }
    return r;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll A, B;
    int C;
    cin >> A >> B >> C;
    ll ans = 0;
    for(int i = 1, r = min((ll)C, A + 1); i < r; i++){
        ans += pow_mod(i, B, C);
        if(ans >= C) ans -= C;
    }
    cout << ans << '\n';
}