#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
vector<long long> A, B;
map<long long, int> ma, mb;
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  if (n * m * 2 % k != 0) {
    puts("NO");
    return 0;
  } else if (!(k & 1)) {
    long long nn = n, mm = m;
    long long x = n;
    for (long long i = 2; i * i <= x; ++i) {
      if (x % i == 0) {
        A.push_back(i);
        while (x % i == 0) x /= i, ma[i]++;
      }
    }
    if (x > 1) A.push_back(x), ma[x]++;
    x = m * 2;
    m *= 2;
    for (long long i = 2; i * i <= x; ++i) {
      if (x % i == 0) {
        B.push_back(i);
        while (x % i == 0) x /= i, mb[i]++;
      }
    }
    if (x > 1) B.push_back(x), mb[x]++;
    x = k;
    for (long long i = 2; i * i <= x; ++i) {
      if (x % i == 0) {
        while (x % i == 0) {
          if (mb[i] > 0)
            mb[i]--, m /= i;
          else
            ma[i]--, n /= i;
          x /= i;
        }
      }
    }
    if (x > 1) {
      if (mb[x] > 0)
        mb[x]--, m /= x;
      else
        ma[x]--, n /= x;
    }
    if (n <= nn && m <= mm) {
      puts("YES");
      puts("0 0");
      printf("0 %lld\n", m);
      printf("%lld 0\n", n);
    } else
      puts("NO");
  } else {
    long long nn = n, mm = m;
    long long x = n;
    for (long long i = 2; i * i <= x; ++i) {
      if (x % i == 0) {
        A.push_back(i);
        while (x % i == 0) x /= i, ma[i]++;
      }
    }
    if (x > 1) A.push_back(x), ma[x]++;
    x = m;
    for (long long i = 2; i * i <= x; ++i) {
      if (x % i == 0) {
        B.push_back(i);
        while (x % i == 0) x /= i, mb[i]++;
      }
    }
    if (x > 1) B.push_back(x), mb[x]++;
    x = k;
    for (long long i = 2; i * i <= x; ++i) {
      if (x % i == 0) {
        while (x % i == 0) {
          if (mb[i] > 0)
            mb[i]--, m /= i;
          else
            ma[i]--, n /= i;
          x /= i;
        }
      }
    }
    if (x > 1) {
      if (mb[x] > 0)
        mb[x]--, m /= x;
      else
        ma[x]--, n /= x;
    }
    if (n * 2 <= nn)
      n *= 2;
    else
      m *= 2;
    if (n <= nn && m <= mm) {
      puts("YES");
      puts("0 0");
      printf("0 %lld\n", m);
      printf("%lld 0\n", n);
    } else
      puts("NO");
  }
  return 0;
}
