#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int x, y, m;
  cin >> x >> y >> m;
  mint::set_mod(m);
  mint ans;
  rep(_, 2) {
    for (int s = 1;; s++) {
      bool done = true;
      for (int t = 0; t < s; t++) {
        if (gcd(s, t) != 1 || (s ^ t) % 2 == 0) continue;
        int a = s * s - t * t, b = 2 * s * t, c = s * s + t * t;
        assert(a > 0 && b >= 0);
        if (c > x + y) break;
        // cout << a << ' ' << b << ' ' << c << endl;
        done = false;
        rep(_, 2) {
          if (!(a == 0 && b == 1)) {
            for (int ak = a, bk = b; 2 * ak < x && 2 * bk < y; ak += a, bk += b) {
              ans += mint(x - 2 * ak) * (y - 2 * bk);
            }
            // cout << x << ' ' << y << ' ' << a << ' ' << b << ' ' << ans.val() << endl;
          }
          swap(a, b);
        }
      }
      if (done) break;
    }
    swap(x, y);
  }
  ans *= 2;
  cout << ans.val() << '\n';
}