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