#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long Inf = INT_MAX;
const double long PI = 3.1415926535;
long long sqr(long long a) { return a * a; }
long long qb(long long a) { return a * a * a; }
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long binpow(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
long long binmult(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
long long n, m, k, g, a, b;
bool first;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m >> k;
  if (2 * n * m % k) {
    cout << "NO";
    return 0;
  }
  first = k % 2 == 0;
  if (first) k /= 2;
  g = gcd(k, n);
  k /= g;
  a = n / g;
  b = m / k;
  if (!first) {
    if (a * 2 <= n)
      a *= 2;
    else
      b *= 2;
  }
  cout << "YES" << '\n';
  cout << "0 0" << '\n';
  cout << a << " 0" << '\n';
  cout << "0 " << b << '\n';
  return 0;
}
