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.
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.HashSet;

public class A {

	public static void main(String[] args) {
		JS in = new JS();
		long N = in.nextLong();
		long M = in.nextLong();
		long K = in.nextLong();
		if(K%2 == 0) {
			long v = K/2;
			long target = N*M;
			if(target % v != 0) {
				System.out.println("NO");
			}
			else {
				ArrayList<Long> f1 = factor(N);
				ArrayList<Long> f2 = factor(M);
				HashSet<Long> facts = new HashSet<Long>();
				for(Long l1 : f1) {
					for(Long l2 : f2) {
						facts.add(l1*l2);
					}
				}
				//System.out.println(facts.size());
				
				long need = target/v;
				for(Long f : facts) {
					if(need%f != 0) continue;
					long v1 = f;
					long v2 = need/f;
					if(N < M) {
						if(Math.min(v1, v2) <= N && Math.max(v1, v2) <= M) {
							System.out.println("YES");
							System.out.println("0 0");
							System.out.println(Math.min(v1, v2)+" 0");
							System.out.println("0 "+Math.max(v1, v2));
							return;
						}
					}
					else {
						if(Math.min(v1, v2) <= M && Math.max(v1, v2) <= N) {
							System.out.println("YES");
							System.out.println("0 0");
							System.out.println(Math.max(v1, v2)+" 0");
							System.out.println("0 "+Math.min(v1, v2));
							return;
						}
					}
				}
				
				System.out.println("NO");
			}
			//x*y*v = target
		}
		else {
			long target = N*M;
			if(target%K != 0) {
				System.out.println("NO");
			}
			else {
				ArrayList<Long> f1 = factor(N);
				ArrayList<Long> f2 = factor(M);
				HashSet<Long> facts = new HashSet<Long>();
				for(Long l1 : f1) {
					for(Long l2 : f2) {
						facts.add(l1*l2);
					}
				}
				long need = target/K;
				need *= 2;
				for(Long f : facts) {
					if(need%f != 0) continue;
					long v1 = f;
					long v2 = need/f;
					if(N < M) {
						if(Math.min(v1, v2) <= N && Math.max(v1, v2) <= M) {
							System.out.println("YES");
							System.out.println("0 0");
							System.out.println(Math.min(v1, v2)+" 0");
							System.out.println("0 "+Math.max(v1, v2));
							return;
						}
					}
					else {
						if(Math.min(v1, v2) <= M && Math.max(v1, v2) <= N) {
							System.out.println("YES");
							System.out.println("0 0");
							System.out.println(Math.max(v1, v2)+" 0");
							System.out.println("0 "+Math.min(v1, v2));
							return;
						}
					}
				}
				System.out.println("NO");
			}
		}
	}

	static ArrayList<Long> factor(long x){
		ArrayList<Long> res = new ArrayList<Long>();
		res.add(1L);
		res.add(x);
		for(long i = 2; i*i <= x; i++) {
			if(x%i==0) {
				res.add(i);
				if(i*i != x) res.add(x/i);
			}
		}
		return res;
	}
	
	static class JS{
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;
		
		public JS() {
			in = new BufferedInputStream(System.in, BS);
		}
		
		public JS(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}
		
		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}				
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}
		
		public int nextInt() {
			return (int)nextLong();
		}
		
		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}
		
		public double nextDouble() {
		    while(c!='.'&&c!='-'&&(c <'0' || c>'9')) c = nextChar();
		    boolean neg = c=='-';
		    if(neg)c=nextChar();
		    boolean fl = c=='.';
		    double cur = nextLong();
		    if(fl) return neg ? -cur/num : cur/num;
		    if(c == '.') {
			double next = nextLong();
			return neg ? -cur-next/num : cur+next/num;
		    }
		    else return neg ? -cur : cur;
		}
		
		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
		
		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
	}
	
}
