Vanya got bored and he painted *n* distinct points on the plane. After that he connected all the points pairwise and saw that as a result many triangles were formed with vertices in the painted points. He asks you to count the number of the formed triangles with the non-zero area.
The first line contains integer *n* (1 ≤ *n* ≤ 2000) — the number of the points painted on the plane. 

Next *n* lines contain two integers each *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ( - 100 ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ≤ 100) — the coordinates of the *i*-th point. It is guaranteed that no two given points coincide.

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

n, m, k = [int(x) for x in input().split()]
x=gcd(n,k)
k/=x
x=n/x;
y=gcd(m,k)
k/=y
y=m/y;
if k != 1 and k != 2:
	print("NO")
	exit()
if k == 1:
	if x*2<=n: 
		x*=2
	elif y*2<=m:
		y*=2
	else:
		print("NO")
		exit()
	print("YES")
	print("0 0");
	print("0 {0}".format(int(y)))
	print("{0} 0".format(int(x)))
if(k==2):
	print("YES")
	print("0 0")
	print("0 {0}".format(int(y)))
	print("{0} 0".format(int(x)))
