from math import gcd


x,y,md = map(int, input().split())
assert 1 <= x <= 4_000_000 and 1 <= y <= 4_000_000 and 100_000_000 <= md <= 1_000_000_000

ans = 0
mx = max(x, y) // 2 + 1
for m in range(0, mx+1):
    for n in range(m+1, mx+1):
        if (m % 2 == n % 2) or gcd(m, n) != 1: continue
        ai = n*n - m*m
        bi = 2*m*n
        if (ai > mx) or (bi > mx): break
        mul = 1
        while (mul * max(ai, bi) <= mx):
            a = ai*mul
            b = bi*mul
            if a*2 < x and b*2 < y:
                if (b == 0): ans = (ans + (x - 2*a) * (y - 2*b) * 2) % md
                else: ans = (ans + (x - 2*a) * (y - 2*b) * 4) % md
            if b*2 < x and a*2 < y:
                if (b == 0): ans = (ans + (x - 2*b) * (y - 2*a) * 2) % md
                else: ans = (ans + (x - 2*b) * (y - 2*a) * 4) % md
            mul += 1
print(ans % md)