#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  scanf("%lld%lld%lld", &n, &m, &k);
  long long g = gcd(n, k);
  long long n1 = n, m1 = m, k1 = k;
  n1 /= g;
  k1 /= g;
  g = gcd(m, k1);
  m1 /= g;
  k1 /= g;
  if (k1 == 1ll) {
    if (n1 * 2ll <= n)
      n1 *= 2ll;
    else if (m1 * 2ll <= m)
      m1 *= 2ll;
    else {
      printf("NO");
      return 0;
    }
  } else if (k1 != 2ll) {
    printf("NO");
    return 0;
  }
  printf("YES\n%lld 0\n0 0\n0 %lld", n1, m1);
}
