#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)

ll modpow(ll a, ll b, ll p = 1e9+7){
    if(b == 0)  return 1;

    if(b % 2 == 0){
        ll d = modpow(a, b/2, p);
        return (d*d) % p;
    }else{
        return (a%p * modpow(a, b-1, p)) % p;
    }
}

ll f(ll x, ll n, ll i){
    return (x + n-i) / n;
}

int main(){
  cin.tie(nullptr);ios_base::sync_with_stdio(false);
  int a,b,c;cin>>a>>b>>c;
  int ans=0;
  rep(i,c){
    ans += f(a, c, i)%c*modpow(i, b, c)%c;
    ans%=c;
  }
  cout<<ans<<endl;
}