#include <bits/stdc++.h>
using namespace std;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const int MAX = 2e5 + 10;
const long long mod = 1e9 + 7;
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 * m * n % k != 0) {
    cout << "NO";
    return 0;
  }
  long long ans1 = 2 * m / gcd(2 * m, k);
  long long ans2 = m * n * 2 / k / ans1;
  if (ans1 > m) {
    ans1 /= 2;
    ans2 *= 2;
  }
  cout << "YES" << '\n';
  cout << "0 0" << '\n';
  cout << "0 " << ans1 << '\n';
  cout << ans2 << " 0";
}
