#include <bits/stdc++.h>
using namespace std;
long long m, n, k;
long long a, b;
long long euclid(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return euclid(b, a % b);
}
int main() {
  cin >> n >> m >> k;
  if ((2 * m * n) % k == 0) {
    if (k % 2 == 0) {
      k = k / 2;
      long long z = euclid(n, k);
      long long tmp = k / z;
      a = n / z;
      b = m / tmp;
    } else {
      long long z = euclid(n, k);
      long long tmp = k / z;
      a = n / z;
      b = m / tmp;
      if (a < n)
        a += a;
      else {
        if (b < m)
          ;
        b += b;
      }
    }
    cout << "YES"
         << "\n";
    cout << 0 << " " << 0 << "\n";
    cout << a << " " << 0 << "\n";
    cout << 0 << " " << b << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
}
