#include <bits/stdc++.h>
const double eps = (1e-9);
using namespace std;
int dcmp(long double a, long double b) {
  return fabsl(a - b) <= eps ? 0 : (a > b) ? 1 : -1;
}
int getBit(int num, int idx) { return ((num >> idx) & 1) == 1; }
int setBit1(int num, int idx) { return num | (1 << idx); }
long long setBit0(long long num, int idx) { return num & ~(1ll << idx); }
long long flipBit(long long num, int idx) { return num ^ (1ll << idx); }
void M() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int countNumBit1(int mask) {
  int ret = 0;
  while (mask) {
    mask &= (mask - 1);
    ++ret;
  }
  return ret;
}
long long n, m;
vector<long long> v;
void primefact(long long n) {
  for (int i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      v.push_back(i);
      n /= i;
    }
  }
  if (n > 1) v.push_back(n);
}
void pfact(long long n) {
  for (int i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      v.erase(find(((v).begin()), ((v).end()), i));
      n /= i;
    }
  }
  if (n > 1) {
    v.erase(find(((v).begin()), ((v).end()), n));
  }
}
int main() {
  long long k;
  cin >> n >> m >> k;
  if ((2 * m * n) % k != 0) {
    cout << "NO\n";
    return 0;
  }
  v.push_back(2);
  primefact(n);
  primefact(m);
  pfact(k);
  long long num = 1;
  sort(((v).rbegin()), ((v).rend()));
  long long s = 1;
  for (int i = 0; i < ((int)(v).size()); i++) {
    s *= v[i];
    if (num * v[i] > n) continue;
    num *= v[i];
  }
  long long x1 = num;
  long long y2 = s / num;
  if (x1 <= n && y2 <= m) {
    cout << "YES\n0 0\n" << x1 << " " << 0 << endl << x1 << " " << y2 << endl;
    return 0;
  }
  cout << "NO\n";
}
