#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  if (2 * n * m % k != 0) {
    cout << "NO\n";
    return 0;
  }
  long long ansn = n * 2, ansm = m;
  for (long long i = 2; i < 500000; i++) {
    while (k % i == 0) {
      k /= i;
      if (ansn % i == 0)
        ansn /= i;
      else if (ansm % i == 0)
        ansm /= i;
      else
        assert(0);
    }
  }
  if (k != 1) {
    if (ansn % k == 0)
      ansn /= k;
    else if (ansm % k == 0)
      ansm /= k;
    else
      assert(0);
  }
  if (ansn > n) {
    assert(ansn % 2 == 0);
    ansn /= 2;
    ansm *= 2;
  }
  assert(ansn <= n && ansm <= m);
  cout << "YES\n";
  cout << "0 0\n";
  cout << ansn << " 0\n";
  cout << "0 " << ansm << "\n";
  return 0;
}
