#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <bitset>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>=b;--i)
#define fore(i, a) for(auto& i : a)
#define pi 3.141592653589793238
typedef long long ll;
typedef pair<ll,ll> pp;
typedef vector<ll> vl;
typedef vector<ulong> vu;
typedef vector<vl> vvl;
typedef vector<pp> vp;
typedef vector<vp> vvp;
typedef priority_queue<pp, vp, greater<pp> > pq;
vl kaijou;
void kaijou_set(ll m) {kaijou.push_back(1); rep(i, 1, 1000009)kaijou.push_back((kaijou[i-1] * i) % m); return;}
ll C(ll a, ll b, ll m) {if(a < b) return 0; return (kaijou[a] * pow_mod(kaijou[a-b] * kaijou[b], m-2, m)) % m;}
template <typename T, typename F>
T bisect(T ok, T bad, F pred) {while (bad - ok > 1) {T mid = ok + (bad - ok) / 2; (pred(mid) ? ok : bad) = mid;} return bad;}
bool chmin(ll &a, ll b) {if (a > b) {a = b;return true;} return false;}
bool chmax(ll &a, ll b) {if (a < b) {a = b;return true;} return false;}
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
ll gcd(ll x, ll y) {if(y == 0)return x; return gcd(y, x % y); }
ll RU(ll a, ll b) {return a / b + (a % b && (a ^ b) >= 0); }
ll mod=998244353; ll mof=1000000007;



int main() 
{
    ll x,y,m;
    cin>>x>>y>>m;
    if(x<y)swap(x,y);

    ll ans_yoko=0,ans_tate=0;
    //円の中心がy=1上にあって、横向きのものだけ
    ll r_lim=(x-1)/2;//ちっちゃい円の半径
    for(ll r=1;r<=r_lim;r++){
        ans_yoko+=x-r*2;
        ans_yoko%=m;
    }
    //cout<<ans_yoko<<endl;
    ans_yoko*=y*2;
    ans_yoko%=m;

    //円の中心がx=1上にあって、縦向きのものだけ
    r_lim=(y-1)/2;
    rep(r,1,r_lim+1){
        ans_tate+=y-r*2;
        ans_tate%=m;
    }
    ans_tate*=x*2;
    ans_tate%=m;


    ll ans_naname=0;
    map<pp,bool>visited;
    rep(M,2,max(x,y)/2+1){
        rep(N,1,M){
            ll a=2*M*N;
            ll b=M*M-N*N;
            if(visited.count(make_pair(a,b)))continue;
            if(a<b)swap(a,b);
            if(gcd(a,b)>=2)continue;
            if(a*2>=x)break;
            visited[make_pair(a,b)]=true;
            ll A=a,B=b;
            while(1){
                bool con=false;
                if(2*a<y&&2*b<x){
                    ans_naname+=(x-2*b)*(y-2*a)*4;
                    //cout<<(x-2*b)*(y-2*a)*4<<endl;
                    //cout<<m<<endl;
                    ans_naname%=m;
                    //cout<<a<<" "<<b<<" "<<ans_naname<<endl;
                    con=true;
                }
                if(2*b<y&&2*a<x){
                    ans_naname+=(x-2*a)*(y-2*b)*4;
                    //cout<<(x-2*a)*(y-2*b)*4<<endl;
                    //cout<<m<<endl;
                    ans_naname%=m;
                    //cout<<a<<" "<<b<<" "<<ans_naname<<endl;
                    con=true;
                }
                a+=A;b+=B;
                if(con==false)break;
            }
        }
    }
    cout<<(ans_yoko+ans_tate+ans_naname)%m<<endl;
    //cout<<ans_yoko<<" "<<ans_tate<<endl;
    
}