#include <bits/stdc++.h>
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  if (2ll * n * m % k != 0)
    puts("NO");
  else {
    if (k % 2 == 0) {
      int g = gcd(n, k / 2);
      printf("YES\n0 0\n%d 0\n0 %d\n", n / g, m / (k / 2 / g));
    } else {
      bool flag = 1;
      int g = gcd(n, k);
      int x = n / g, y = m / (k / g);
      if (2 * x <= n)
        x *= 2;
      else if (2 * y <= m)
        y *= 2;
      else
        puts("NO"), flag = 0;
      if (flag) printf("YES\n0 0\n%d 0\n0 %d\n", x, y);
    }
  }
  return 0;
}
