#include <bits/stdc++.h>
using namespace std;
void solve() {}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
  return b ? gcd(b, a % b) : a;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  unsigned long long n, m, k;
  cin >> n >> m >> k;
  unsigned long long cpy = k;
  if ((2 * n * m) % k) {
    cout << "NO" << '\n';
    return 0;
  }
  if (k % 2 == 0) {
    k /= 2;
  }
  unsigned long long g = gcd(n, k);
  unsigned long long a = n / g;
  k /= g;
  g = gcd(m, k);
  unsigned long long b = m / g;
  k /= g;
  if (cpy % 2) {
    if (a < n)
      a *= 2;
    else
      b *= 2;
  }
  cout << "YES" << '\n';
  cout << "0 0" << '\n';
  cout << 0 << " " << b << '\n';
  cout << a << " " << 0 << '\n';
}
