def gcd(a, b):
  while a != 0:
    b %= a
    if b == 0: return a
    a %= b
  return b

P = []
N = 4000000
for m in range(1,N + 1):
  for n in range(1,m):
    if (m - n) % 2 == 0:
      continue
    if gcd(m,n) != 1:
      continue
    if 2 * m * n > N:
      break
    if m * m - n * n > N:
      continue
    a,b,c = m ** 2 - n ** 2,2 * m * n,m ** 2 + n ** 2
    P.append((a,b,c))
    P.append((b,a,c))

X,Y,M = map(int,input().split())
ans = 0
# X
RX = [0 for i in range(X + 1)]
for x in range(2,X):
  r = min(X - x,x - 1)
  RX[1] += 1
  RX[r + 1] -= 1
  ans += r * Y
for i in range(X):
  RX[i + 1] += RX[i]

RY = [0 for i in range(Y + 1)]
for y in range(2,Y):
  r = min(Y - y,y - 1)
  RY[1] += 1
  RY[r + 1] -= 1
  ans += r * X
for i in range(Y):
  RY[i + 1] += RY[i]

for a,b,c in P:
  for i in range(1,min(X,Y) + 1):
    if a * i > X:
      break
    if b * i > Y:
      break
    ans += RX[a * i] * RY[b * i] % M
    ans %= M
ans = ans * 2 % M
print(ans)