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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.List;
import java.util.Random;
import java.util.StringTokenizer;

/*
 * Target : Tshirt in a major programming competition.
 */
public class Main implements Runnable {

	int sz[];
	int id[];
	List<Integer> edges[];
	int MAXN = (int) 1.5e7 + 1;

	private void solve() throws IOException {
		long n = nextInt();
		long m = nextInt();
		long k = nextInt();
		if (k > 2 * n * 1L * m) {
			pw.println("NO");
			return;
		}
		if (2 * n * 1L * m % k != 0) {
			pw.println("NO");
			return;
		}
		long prod = 2 * n * 1L * m / k;
		long g1 = gcd(2 * n, k);
		long g2 = gcd(2 * m, k);
		long a = 2 * n / g1;
		long b = prod / a;
//		System.err.println(a + " " + b);
		if (a > n || b > m) {
			b = 2 * m / g2;
			a = prod / b;
		}
		pw.println("YES");
		pw.println("0 0");
		pw.println(a + " " + 0);
		pw.println(0 + " " + b);

	}

	long gcd(long a, long b) {
		return b == 0 ? a : gcd(b, a % b);
	}

	void dbg(Object a[]) {
		System.err.println(Arrays.deepToString(a));
	}

	void test() throws IOException {
		Random rnd = new Random();
		for (int i = 0; i < 10; ++i) {
			int n = rnd.nextInt(10) + 1;
			int a[] = new int[n];
			System.err.println(n);
			for (int j = 0; j < n; ++j) {
				a[j] = rnd.nextInt(100) + 1;
				System.err.print(a[j] + " ");
			}
			System.err.println();
//			solve(a);
		}
	}

	BufferedReader br;
	StringTokenizer st;
	PrintWriter pw;

	public static void main(String args[]) {
		new Main().run();
	}

	public void run() {
		try {
			br = new BufferedReader(new InputStreamReader(System.in));
			pw = new PrintWriter(System.out);
			st = null;
			solve();
			pw.flush();
			pw.close();
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine());
		}
		return st.nextToken();
	}
}
