#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll A, B;
    int C;
    cin >> A >> B >> C;
    auto func = [](ll x, ll n, int m){
        ll res = 1;
        while(n > 0){
            if(n & 1)   res = res * x % m;
            x = x * x % m;
            n >>= 1;
        }
        return res;
    };
    vector<ll> S(C);
    for(int i = 1; i < C; ++i){
        S[i] = (S[i - 1] + func(i, B, C)) % C;
    }
    cout << (S[C - 1] * (A / C) + S[A % C]) % C << endl;

    return 0;
}