/** * @FileName a.cpp * @Author kanpurin * @Created 2020.08.13 18:19:52 **/ #include "bits/stdc++.h" using namespace std; typedef long long ll; int MOD = 1e9 + 7; struct mint { private: long long x; public: mint(long long x = 0) :x((MOD+x)%MOD) {} mint(std::string &s) { long long z = 0; for (int i = 0; i < s.size(); i++) { z *= 10; z += s[i] - '0'; z %= MOD; } this->x = z; } mint& operator+=(const mint &a) { if ((x += a.x) >= MOD) x -= MOD; return *this; } mint& operator-=(const mint &a) { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; } mint& operator*=(const mint &a) { (x *= a.x) %= MOD; return *this; } mint& operator/=(const mint &a) { long long n = MOD - 2; mint u = 1, b = a; while (n > 0) { if (n & 1) { u *= b; } b *= b; n >>= 1; } return *this *= u; } mint operator+(const mint &a) const { mint res(*this); return res += a; } mint operator-(const mint &a) const { mint res(*this); return res -= a; } mint operator*(const mint &a) const { mint res(*this); return res *= a; } mint operator/(const mint &a) const { mint res(*this); return res /= a; } friend std::ostream& operator<<(std::ostream &os, const mint &n) { return os << n.x; } bool operator==(const mint &a) const { return this->x == a.x; } }; template T pow(T k, U n, T unity = 1) { while (n > 0) { if (n & 1) { unity *= k; } k *= k; n >>= 1; } return unity; } int main() { ll a,b,c;cin >> a >> b >> c; MOD = c; mint total = 0,ans = 0; for (int i = 0; i < c; i++) { total += pow(mint(i),b); if (a % c == i) { ans += total; } } ans += total * (a / c); cout << ans << endl; return 0; }