#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
mint sum(long long n){
	mint ret = n;
	ret *= n+1;
	return ret;
}
mint get(long long X,long long Y){
	mint ret = 0;
	ret += sum((Y-1)/2);
	if(Y%2==1)ret -= Y/2;
	ret *= X;
	return ret;
}
int main(){
	
	long long X,Y,M;
	cin>>X>>Y>>M;
	mint::set_mod(M);
	mint ans = 0;
	ans += get(X,Y);
	ans+= get(Y,X);
	ans *= 2;
	cout<<ans.val()<<endl;
    return 0;
}