#include <bits/stdc++.h>
using namespace std;
int n, m, k, g, a, b;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  scanf("%d %d %d", &n, &m, &k);
  if (2ll * n * m % k)
    printf("NO\n");
  else {
    if (k % 2 == 0) {
      k /= 2;
      g = gcd(n, k);
      a = n / g;
      b = m / (k / g);
    } else {
      g = gcd(n, k);
      a = n / g;
      b = m / (k / g);
      if (2ll * a <= n)
        a *= 2;
      else
        b *= 2;
    }
    printf("YES\n%d %d\n%d %d\n%d %d\n", 0, 0, a, 0, 0, b);
  }
  return 0;
}
