#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f2f1f0f;
const long long LINF = 1ll * INF * INF;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long N, M, K;
int main() {
  cin >> N >> M >> K;
  long long all = 2 * N * M;
  if (all % K != 0) return puts("NO") < 0;
  all /= K;
  long long g = gcd(2 * N, K);
  long long x, y;
  if (g == 1) {
    x = N, y = all / x;
  } else {
    x = (2 * N / g), y = all / x;
  }
  printf("YES\n0 0\n%lld 0\n0 %lld\n", x, y);
  return 0;
}
