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