def f(N):
	# Nを4平方和で表す O(N^2)
	for a in range(N+1):
		if 4*a*a>N: break
		for b in range(a,N+1):
			if a*a+3*b*b>N: break
			for c in range(b,N+1):
				if a*a+b*b+c*c>N: break
				for d in range(c,N+1):
					v=a*a+b*b+c*c+d*d
					if v>N: break
					if v==N: return (a,b,c,d)
	assert 0

def mul(p,q,M):
	return (
		(p[0]*q[0]+p[1]*q[1]+p[2]*q[2]+p[3]*q[3])%M,
		(p[0]*q[1]-p[1]*q[0]+p[2]*q[3]-p[3]*q[2])%M,
		(p[0]*q[2]-p[1]*q[3]-p[2]*q[0]+p[3]*q[1])%M,
		(p[0]*q[3]+p[1]*q[2]-p[2]*q[1]-p[3]*q[0])%M,
	)

N,M,B=map(int,input().split())

b=f(M)
ans=(0,0,0,1)
while N:
	if N%2:
		ans=mul(ans,b,B)
	b=mul(b,b,B)
	N//=2

print("YES")
print(*ans,0,0)