#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 1000000007;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "[";
  for (const auto &v : vec) {
    os << v << ",";
  }
  os << "]";
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
void solve() {
  long long N, M, K;
  cin >> N >> M >> K;
  for (int i = 1; i * i <= K; i++) {
    if (K % i == 0) {
      int j = K / i;
      if ((2 * N) % i == 0 && M % j == 0 && (2 * N) / i <= N) {
        cout << "YES" << endl;
        cout << "0 0" << endl;
        cout << (2 * N) / i << " 0" << endl;
        cout << "0 " << M / j << endl;
        return;
      }
      if (N % i == 0 && (M * 2) % j == 0 && (2 * M) / j <= M) {
        cout << "YES" << endl;
        cout << "0 0" << endl;
        cout << N / i << " 0" << endl;
        cout << "0 " << (2 * M) / j << endl;
        return;
      }
      if ((2 * N) % j == 0 && M % i == 0 && (2 * N) / j <= N) {
        cout << "YES" << endl;
        cout << "0 0" << endl;
        cout << (2 * N) / j << " 0" << endl;
        cout << "0 " << M / i << endl;
        return;
      }
      if (N % j == 0 && (M * 2) % i == 0 && (2 * M) / i <= M) {
        cout << "YES" << endl;
        cout << "0 0" << endl;
        cout << N / j << " 0" << endl;
        cout << "0 " << (2 * M) / i << endl;
        return;
      }
    }
  }
  cout << "NO" << endl;
}
int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(16);
  solve();
  return 0;
}
