#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const double pi =
    3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
long long nwd(long long a, long long b) { return b ? nwd(b, a % b) : a; }
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  long long d = nwd(n * (long long)m, k);
  int tmp = d;
  long long dn = nwd(tmp, n);
  int nd = n / dn;
  tmp /= dn;
  long long dm = nwd(tmp, m);
  int md = m / dm;
  k /= d;
  if (k > 2) {
    printf("NO\n");
    return 0;
  }
  if (k == 1) {
    if (2 * nd <= n)
      printf("YES\n0 0\n%d 0\n0 %d\n", 2 * nd, md);
    else if (2 * md <= m)
      printf("YES\n0 0\n%d 0\n0 %d\n", nd, 2 * md);
    else
      printf("NO\n");
  } else
    printf("YES\n0 0\n%d 0\n0 %d\n", nd, md);
  return 0;
}
