#include <bits/stdc++.h>
using namespace std;
const int inv = 1000000000;
const int minv = -inv;
long long fgcd(long long a, long long b) {
  if (a == 0ll)
    return b;
  else
    return fgcd(b % a, a);
}
long long m, n, k;
int main() {
  cin >> m;
  cin >> n;
  cin >> k;
  if ((2ll * m * n) % k != 0ll) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  if (k & 1ll) {
    long long x = fgcd(m, k);
    long long y = k / x;
    if (x > 1ll) {
      cout << 0ll << " ";
      cout << 0ll << "\n";
      cout << (2ll * m) / x << " ";
      cout << 0ll << "\n";
      cout << 0ll << " ";
      cout << n / y << "\n";
    } else {
      cout << 0ll << " ";
      cout << 0ll << "\n";
      cout << m / x << " ";
      cout << 0ll << "\n";
      cout << 0ll << " ";
      cout << (2ll * n) / y << "\n";
    }
  } else {
    k = k / 2ll;
    long long x = fgcd(m, k);
    long long y = k / x;
    cout << 0ll << " ";
    cout << 0ll << "\n";
    cout << m / x << " ";
    cout << 0ll << "\n";
    cout << 0ll << " ";
    cout << n / y << "\n";
  }
  return 0;
}
