#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (!a || !b) return (!a ? b : a);
  if (a < b) swap(a, b);
  long long f = a & 1, s = b & 1;
  if (f && s) {
    return gcd((a - b) >> 1, b);
  } else if (!f && s) {
    return gcd(a >> 1, b);
  } else if (f && !s) {
    return gcd(a, b >> 1);
  } else {
    return (gcd(a >> 1, b >> 1) << 1);
  }
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  if ((2 * n * m) % k != 0) {
    cout << "NO" << endl;
    return 0;
  }
  long long a = gcd(n, k);
  cout << "YES" << endl;
  if (2 * a * m / k <= m) {
    cout << 0 << " " << 0 << endl;
    cout << n / a << " " << 0 << endl;
    cout << 0 << " " << 2 * a * m / k << endl;
    return 0;
  }
  if (2 * n / a <= n) {
    cout << 0 << " " << 0 << endl;
    cout << 2 * n / a << " " << 0 << endl;
    cout << 0 << " " << a * m / k << endl;
  }
}
