n,x,m = gets.split.map(&:to_i)
db = Array.new(Math.log(n,2).to_i+1).map{Array.new(m)}
s = Array.new(Math.log(n,2).to_i+1).map{Array.new(m)}

y = x
while true
  if db[0][y**2%m]
    db[0][y] = y**2%m
    s[0][y] = y**2%m
    break
  else
    db[0][y] = y**2%m
    s[0][y] = y**2%m
    y = y**2%m
  end
end
for i in 0..(Math.log(n,2).to_i-1)
  for j in 0..(m-1)
    if  db[i][j] != nil
      db[i+1][j] = db[i][db[i][j]]
      s[i+1][j] = s[i][j] + s[i][db[i][j]]
    end
  end
end
sum = x
pre = x
for k in 0..(Math.log(n,2))
  if n[k] == 1
    sum += s[k][pre]
    pre = db[k][pre]
  end
end
puts sum-pre