#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000 + 7;
const long long LL_INF = 1ll * INF * INF;
const int MAX_N = 100000 + 7;
template <typename T>
inline void addmod(T& a, const long long& b, const int& MOD = INF) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
long long m, n, k;
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); }
void solve() {
  cin >> n >> m >> k;
  if (2 * m * n % k != 0) {
    cout << "NO";
  } else {
    cout << "YES\n";
    cout << 0 << ' ' << 0 << '\n';
    long long tmp = 2 * m / gcd(2 * m, k);
    if (tmp <= m) {
      cout << 0 << ' ' << 2 * m / gcd(2 * m, k) << '\n';
      k /= gcd(2 * m, k);
      cout << n / k << ' ' << 0 << '\n';
    } else {
      cout << 0 << ' ' << m / gcd(m, k) << '\n';
      k /= gcd(m, k);
      cout << 2 * n / k << ' ' << 0 << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  const bool multiple_test = false;
  int test = 1;
  if (multiple_test) cin >> test;
  for (int i = 0; i < test; ++i) {
    solve();
  }
}
