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.*;
import java.util.*;

public class B1 {
	
	int gcd(int a, int b) {
		if (b == 0) 
			return a;
		return gcd(b, a % b);
	}
	
	void solve() throws IOException {
		int n = readInt();
		int m = readInt();
		int k = readInt();
		
		int nk = gcd(n, k);
		int x = n / nk;
		k /= nk;
		
		int mk = gcd(m, k);
		int y = m / mk;
		k /= mk;
		if (k > 2) {
			out.println("nO");
			return;
		}
		
		if (k == 1) {
			if (x * 2 <= n) { 
				out.println("yEs");
				out.println("0 0");
				out.println(x * 2 + " 0");
				out.println("0 " + y);
				return;
			} if (y * 2 <= m) {
				out.println("yEs");
				out.println("0 0");
				out.println(x + " 0");
				out.println("0 " + y * 2);
				return;
			}
			out.println("nO");
		} else {
			out.println("yEs");
			out.println("0 0");
			out.println(x + " 0");
			out.println("0 " + y);
			return;
		}
		
	}
	
	/////////////////////////////////////////////////////////////////////////////

	void init() throws FileNotFoundException {
		
		if (ONLINE_JUDGE) {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
		} else {
			in = new BufferedReader(new FileReader("input.txt"));
			out = new PrintWriter("output.txt");
		}
		
		tok = new StringTokenizer(" ");
	}
	
	//////////////////////////////////////////////////////////////////////////////
	
	static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

	public static void main(String[] args) {
		new B1().run();
	}
	
	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok;
	
	void run() {
		try {
			long timeStart = System.currentTimeMillis();
			
			init();
			solve();
			
			out.close();
			
			long timeEnd = System.currentTimeMillis();
			System.err.println("Time = " + (timeEnd - timeStart));
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(-1);
		}
	}
	
	//READ//////////////////////////////////////////////////////////////////
	
	String readLine() throws IOException {
		return in.readLine();
	}
	 
	String delimiter = " ";
	
	String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			String nextLine = readLine();
			if (null == nextLine) return null;
			
			tok = new StringTokenizer(nextLine);
		}
		
		return tok.nextToken(delimiter);
	}
	
	int readInt() throws IOException {
		return Integer.parseInt(readString());
	}
	
	long readLong() throws IOException {
		return Long.parseLong(readString());
	}
	
	double readDouble() throws IOException {
		return Double.parseDouble(readString());
	}
	
	//*********************************************************************
}