#include <bits/stdc++.h>
using namespace std;
map<long long, long long> prfac(long long n) {
  map<long long, long long> ans;
  if (n < 2) {
    return ans;
  }
  while (n % 2 == 0) {
    ans[2]++;
    n /= 2;
  }
  while (n % 3 == 0) {
    ans[3]++;
    n /= 3;
  }
  for (long long i = 6; (i - 1) * (i - 1) <= n; i += 6) {
    long long x = i - 1;
    while (n % x == 0) {
      ans[x]++;
      n /= x;
    }
    x = i + 1;
    while (n % x == 0) {
      ans[x]++;
      n /= x;
    }
  }
  if (n > 1) {
    ans[n]++;
  }
  return ans;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m, k;
  cin >> n >> m >> k;
  if (n * m * 2 % k != 0) {
    cout << "NO";
    return 0;
  }
  long long lb = (2 * m + k - 1) / k;
  if (lb > m) {
    cout << "NO";
    return 0;
  }
  long long a = 2 * n * m / k;
  if (sqrt(a) < m - lb + 1) {
    for (long long i = 1; i * i <= a; i++) {
      if (a % i == 0) {
        long long x = i;
        if (x >= lb && x <= m) {
          cout << "YES\n0 0\n0 " << x << "\n" << a / x << " 0";
          return 0;
        }
        x = a / i;
        if (x >= lb && x <= m) {
          cout << "YES\n0 0\n0 " << x << "\n" << a / x << " 0";
          return 0;
        }
      }
    }
  } else {
    for (long long i = lb; i <= m; i++) {
      if (a % i == 0) {
        cout << "YES\n0 0\n" << a / i << " 0\n0 " << i;
        return 0;
      }
    }
  }
  cout << "NO";
  return 0;
}
