#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
  long long res = 1;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a;
    a = a * a;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m, k;
  cin >> n >> m >> k;
  long long cmp = 2 * n * m;
  if (cmp % k != 0) {
    cout << "NO\n";
    return 0;
  }
  cmp /= k;
  cout << "YES\n";
  long long cm = n * m;
  if (cm % k == 0) {
    long long a = gcd(n, k);
    long long b = k / a;
    cout << "0 0\n";
    a = n / a;
    b = m / b;
    if (a < n)
      a *= 2;
    else
      b *= 2;
    cout << a << ' ' << "0\n";
    cout << "0 " << b << '\n';
  } else {
    long long a = gcd(n, k);
    long long b = k / a;
    if (a > 1) {
      n = (n) / a, m = (2 * m) / b;
    } else {
      m = (2 * m) / b;
      n = n / a;
    }
    cout << "0 0\n";
    cout << n << " 0\n";
    cout << "0 " << m << '\n';
  }
  return 0;
}
