Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.

Help Vasya! Find such points (if it's possible). If there are multiple solutions, print any of them.

Input

The single line contains three integers n, m, k (1≤ n, m ≤ 10^9, 2 ≤ k ≤ 10^9).

Output

If there are no such points, print "NO".

Otherwise print "YES" in the first line. The next three lines should contain integers x_i, y_i — coordinates of the points, one point per line. If there are multiple solutions, print any of them.

You can print each letter in any case (upper or lower).

Examples

Input

4 3 3


Output

YES
1 0
2 3
4 1


Input

4 4 7


Output

NO

Note

In the first example area of the triangle should be equal to nm/k = 4. The triangle mentioned in the output is pictured below: 

<image>

In the second example there is no triangle with area nm/k = 16/7.
'''input
3 3 6



'''
from collections import defaultdict as df
from bisect import bisect_left as bl 
import sys
from fractions import Fraction as F
def gcd(a,b):
	if b==0:
		return a
	return gcd(b,a%b)

	
n,m,k=[int(x) for x in raw_input().split()]
		
def sieve(n):
	pr=[1]*n
	pr[0]=0
	pr[1]=0

	for i in range(4,n,2):
		pr[i]=0

	for i in range(3,int(n**0.5)+1,2):
		if pr[i]==1:
			for j in range(i*i,n,2*i):
				pr[j]=0
	return pr

def primes(n):
	P=sieve(n)
	pr=[]
	for i in range(n):
		if P[i]:
			pr.append(i)
	return pr

P=primes(10**5)
def factorise(n):
	sq=int(n**0.5)+1
	fac=[]
	for i in range(sq):
		if n%i==0:
			fac.append(i)
			fac.append(n/i)
	return list(set(fac))

if n*m%k==0:
	area=n*m/k
	area*=2
	gc=gcd(n,k)
	#gc2=gcd(m,k)
	a1=gc
	a2=k/gc
	a1=n/a1
	a2=m/a2

	b1=gcd(m,k)
	b2=k/gc
	b1=n/b1
	b2=m/b2
	if n*m>=area:
		if a1*2<=n:
			print "YES"
			print 0,0
			print a1*2,0
			print 0,a2
		elif a2*2<=m:
			print "YES"
			print 0,0
			print a1,0
			print 0,a2*2
		elif b1*2<=n:
			print "YES"
			print 0,0
			print b1*2,0
			print 0,b2
		elif b2*2<=m:
			print "YES"
			print 0,0
			print b1,0
			print 0,b2*2
		else:
			print "NO"
	else:
		print "NO"
elif n*m*2%k==0:
	area=n*m/k
	area*=2
	gc=gcd(n*2,k)
	#gc2=gcd(m,k)
	a1=gc
	a2=k/gc
	a1=n*2/a1
	a2=m/a2

	b1=gcd(m*2,k)
	b2=k/gc
	b1=n*2/b1
	b2=m/b2
	if n*m>=area:
		if a1<=n:
			print "YES"
			print 0,0
			print a1,0
			print 0,a2
		elif a2<=m:
			print "YES"
			print 0,0
			print a1,0
			print 0,a2
		elif b1<=n:
			print "YES"
			print 0,0
			print b1,0
			print 0,b2
		elif b2<=m:
			print "YES"
			print 0,0
			print b1,0
			print 0,b2
		else:
			print "NO"
	else:
		print "NO"

else:
	print "NO"
#main()
     
