#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long gcd(long long a, long long b) {
  while (a > 0 && b > 0) {
    if (a > b)
      a %= b;
    else
      b %= a;
  }
  return a + b;
}
void res() {
  if ((n * m * 2) % k != 0) {
    cout << "NO" << endl;
    return;
  }
  int n1 = n;
  int m1 = m;
  int gcdnk = gcd(n, k);
  n /= gcdnk;
  k /= gcdnk;
  int gcdmk = gcd(m, k);
  m /= gcdmk;
  k /= gcdmk;
  if (k == 1) {
    if (n < n1) {
      cout << "YES\n0 0\n"
           << n * 2 << " 0\n"
           << "0 " << m << endl;
    } else {
      cout << "YES\n0 0\n"
           << n << " 0\n"
           << "0 " << m * 2 << endl;
    }
    return;
  }
  cout << "YES\n0 0\n"
       << n << " 0\n"
       << "0 " << m << endl;
  return;
}
int main() {
  cin >> n >> m >> k;
  res();
  return 0;
}
