#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

ll modpow(ll a,ll b,ll mod){
    ll ans = 1;
    a %= mod;
    while(b){
        if(b&1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll A,B,C; cin >> A >> B >> C;
    if(C == 1) { cout << 0 << endl; return 0; }
    ll ans = 0;
    for(int r = 0; r < C; r++) {
        // 0 <= x <= A
        // x % C = r
        ll cnt = A / C + (r <= A % C);
        ans += cnt * modpow(r, B, C) % C;
        if(ans >= C) ans -= C;
    }
    cout << ans << endl;
}