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