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

public class Test5 {

    Random rnd = new Random();
    PrintWriter pw = new PrintWriter(System.out);
    ArrayList<Integer>[] l;
    static int[] n;


    void run(){
        long n = ni(), m = ni(), k = ni(), s2, a,h;
        if((2*n*m)%k!=0) pw.print("NO");
        else{
            if((2*n)%k>0 && (2*m)%k>0){
                ArrayList<Long> l = GetDel.get(n*m*2/k);
                for(long d : l){
                    a = d;
                    h = n*m*2/k/d;
                    if(a<=n && h<=m){
                        pw.println("YES");
                        pw.println(0+" "+0);
                        pw.println(a+" "+0);
                        pw.println(0+" "+h);
                        pw.flush();
                        return;
                    }
                }
                pw.println("NO");
            }
            else {
                pw.println("YES");
                pw.println(0 + " " + 0);
                if((2*m)%k==0) {
                    pw.println(n + " " + 0);
                    pw.println(0 + " " + (2*m/k));
                }
                else{
                    pw.println(0 + " " + m);
                    pw.println((2*n/k) + " " + 0);
                }
            }
        }
        pw.flush();
    }

    static class GetDel {

        static ArrayList<Integer> k = new ArrayList<>();

        static ArrayList<Long> get(long ch){
            k = new ArrayList<>();
            long c=1;
            int ks=0, i, del = 1;
            ArrayList<Long> otv = new ArrayList<>(), t = f(ch);
            ks = k.size();
            i = t.size();
            int[] itr = new int[ks];
            long[][] pow = new long[i][40];
            for(int q=0; q<i; q++){
                for(int w=0; w<=k.get(q); w++) pow[q][w] = (long)Math.pow(t.get(q), w);
            }
            for(int q=0; q<ks; q++) del*=k.get(q)+1;
            for(; del>0; c=1, del--){
                for(int w=ks-1; w>=0; w--){
                    if(++itr[w]>k.get(w)) itr[w]=0;
                    else break;
                }
                for(int u=0; u<ks; u++) c*= pow[u][itr[u]];
                otv.add(c);
            }
            Collections.sort(otv);
            return otv;
        }


        static ArrayList<Long> f(long a){
            ArrayList<Long> l = new ArrayList<>();
            for(long d = 2; d*d<=a || d<4; d++){
                if(a%d<1){
                    int u=0;
                    for(; a%d<1; ) {a/=d; u++;}
                    l.add(d);
                    k.add(u);
                }
            }
            for(long d=6; d*d<=a; d+=6){
                if(a%(d-1)<1){
                    int u=0;
                    for(; a%(d-1)<1; ) {a/=(d-1); u++;}
                    l.add(d-1);
                    k.add(u);
                }
                if(a%(d+1)<1){
                    int u=0;
                    for(; a%(d+1)<1; ) {a/=(d+1); u++;}
                    l.add(d+1);
                    k.add(u);
                }
            }
            if(a>1) {
                if(l.size()<1) {l.add(a); k.add(1);}
                else{
                    if(l.get(l.size()-1)!=a) {l.add(a); k.add(1);}
                    else{
                        k.add(k.get(k.size()-1)+1);
                        k.remove(k.size()-2);
                    }
                }
            }
            return l;
        }
    }

    static long gcd(long a, long b){
        a = Math.abs(a);
        b = Math.abs(b);
        for(; a>0 && b>0;){
            if(a>b) a%=b;
            else b%=a;
        }
        return a+b;
    }

    static class PyraSort {

        private static int heapSize;

        public static void sort(int[] a) {
            buildHeap(a);
            while (heapSize > 1) {
                swap(a, 0, heapSize - 1);
                heapSize--;
                heapify(a, 0);
            }
        }

        private static void buildHeap(int[] a) {
            heapSize = a.length;
            for (int i = a.length / 2; i >= 0; i--) {
                heapify(a, i);
            }
        }

        private static void heapify(int[] a, int i) {
            int l = 2 * i + 2;
            int r = 2 * i + 1;
            int largest = i;
            if (l < heapSize && a[i] < a[l]) {
                largest = l;
            }
            if (r < heapSize && a[largest] < a[r]) {
                largest = r;
            }
            if (i != largest) {
                swap(a, i, largest);
                heapify(a, largest);
            }
        }

        private static void swap(int[] a, int i, int j) {
            a[i] ^= a[j] ^= a[i];
            a[j] ^= a[i];
            n[i] ^= n[j] ^= n[i];
            n[j] ^= n[i];
        }
    }

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

    InputStream is = System.in;
    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;

    private int readByte() {
        if (lenbuf == -1) throw new InputMismatchException();
        if (ptrbuf >= lenbuf) {
            ptrbuf = 0;
            try {
                lenbuf = is.read(inbuf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (lenbuf <= 0) return -1;
        }
        return inbuf[ptrbuf++];
    }

    private boolean isSpaceChar(int c) {
        return !(c >= 33 && c <= 126);
    }

    private int skip() {
        int b;
        while ((b = readByte()) != -1 && isSpaceChar(b)) ;
        return b;
    }

    private double nd() {
        return Double.parseDouble(ns());
    }

    private char nc() {
        return (char) skip();
    }

    private String nline(){
        int b = readByte();
        StringBuilder sb = new StringBuilder();
        while (b!=10) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while (!(isSpaceChar(b))) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while (p < n && !(isSpaceChar(b))) {
            buf[p++] = (char) b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    private char[][] nm(int n, int m) {
        char[][] map = new char[n][];
        for (int i = 0; i < n; i++) map[i] = ns(m);
        return map;
    }

    private int[] na(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ni();
        return a;
    }

    private int ni() {
        int num = 0, b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
}
