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