#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long i, j, n, m, arr[200200], first, f1, f2, t, brr[200200], a, k, b;
int main() {
  t = 1;
  while (t--) {
    cin >> n >> m >> k;
    f1 = k;
    if ((2 * n * m) / k > n * m) {
      cout << "NO";
      return 0;
    }
    if ((2 * n * m) % k != 0) {
      cout << "NO";
      return 0;
    }
    cout << "YES\n";
    i = k;
    if (k % 2 == 0) {
      i = k / 2;
      f2 = 1;
    } else
      f2 = 0;
    long long g = gcd(i, n);
    k = i / g;
    a = n / g;
    b = m / k;
    if (a * b != 2 * n * m / f1) {
      if (a < n)
        a *= 2;
      else if (b < m)
        b *= 2;
    }
    cout << "0 0\n"
         << "0 " << b << "\n"
         << a << " 0";
  }
}
