#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long in = n, im = m;
  if ((2 * n * m) % k != 0) {
    cout << "NO\n";
    return;
  }
  bool poss = true;
  if (k % 2 == 0)
    k /= 2;
  else
    poss = false;
  vector<long long> fac;
  fac.push_back(k);
  for (long long i = 2; i * i <= k; i++) {
    if (k % i == 0) {
      fac.push_back(i);
      fac.push_back(k / i);
    }
  }
  sort(fac.begin(), fac.end());
  for (long long i = fac.size() - 1; i >= 0; i--) {
    if (k == 1) break;
    if (n % fac[i] == 0 && k % fac[i] == 0) {
      n /= fac[i];
      k /= fac[i];
    }
    if (m % fac[i] == 0 && k % fac[i] == 0) {
      m /= fac[i];
      k /= fac[i];
    }
  }
  if (!poss) {
    if (n * 2 <= in)
      n *= 2, poss = true;
    else if (m * 2 <= im)
      m *= 2, poss = true;
  }
  if (!poss) {
    cout << "NO\n";
    return;
  }
  cout << "YES\n";
  cout << "0 0" << endl;
  cout << "0 " << m << endl;
  cout << n << " 0" << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) solve();
}
