Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.

Help Vasya! Find such points (if it's possible). If there are multiple solutions, print any of them.

Input

The single line contains three integers n, m, k (1≤ n, m ≤ 10^9, 2 ≤ k ≤ 10^9).

Output

If there are no such points, print "NO".

Otherwise print "YES" in the first line. The next three lines should contain integers x_i, y_i — coordinates of the points, one point per line. If there are multiple solutions, print any of them.

You can print each letter in any case (upper or lower).

Examples

Input

4 3 3


Output

YES
1 0
2 3
4 1


Input

4 4 7


Output

NO

Note

In the first example area of the triangle should be equal to nm/k = 4. The triangle mentioned in the output is pictured below: 

<image>

In the second example there is no triangle with area nm/k = 16/7.
#include <bits/stdc++.h>
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T>
void scan(V<T> &);
template <class T, class L>
void scan(pair<T, L> &);
template <class T>
void scan(V<T> &a) {
  for (auto &i : a) scan(i);
}
template <class T, class L>
void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T>
void scan(T &a) {
  cin >> a;
}
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &...tail) {
  scan(head);
  INPUT(tail...);
}
template <class T>
inline void print(T x) {
  cout << x << '\n';
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}
template <class T>
ostream &operator<<(ostream &os, const V<T> &v) {
  for (int i = (0); i < (((int)(v).size())); ++i) {
    if (i) os << " ";
    os << v[i];
  }
  return os;
}
template <typename T>
void view(const V<T> &v) {
  cerr << "{ ";
  for (const auto &e : v) {
    cerr << e << ", ";
  }
  cerr << "\b\b }";
}
template <typename T>
void view(const VV<T> &vv) {
  cerr << "{\n";
  for (const auto &v : vv) {
    cerr << "\t";
    view(v);
    cerr << "\n";
  }
  cerr << "}";
}
template <typename T, typename U>
void view(const V<pair<T, U>> &v) {
  cerr << "{\n";
  for (const auto &c : v) cerr << "\t(" << c.first << ", " << c.second << ")\n";
  cerr << "}";
}
template <typename T, typename U>
void view(const map<T, U> &m) {
  cerr << "{\n";
  for (auto &t : m) cerr << "\t[" << t.first << "] : " << t.second << "\n";
  cerr << "}";
}
template <typename T, typename U>
void view(const pair<T, U> &p) {
  cerr << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
void view(const set<T> &s) {
  cerr << "{ ";
  for (auto &t : s) {
    view(t);
    cerr << ", ";
  }
  cerr << "\b\b }";
}
template <typename T>
void view(T e) {
  cerr << e;
}
template <class T>
V<T> press(V<T> &x) {
  V<T> res = x;
  sort((res).begin(), (res).end());
  res.erase(unique((res).begin(), (res).end()), res.end());
  for (int i = (0); i < (((int)(x).size())); ++i) {
    x[i] = lower_bound((res).begin(), (res).end(), x[i]) - res.begin();
  }
  return res;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
inline void err(bool b = true) {
  if (b) {
    cout << -1 << '\n';
    exit(0);
  }
}
template <class T>
inline void fin(bool b = true, T e = 0) {
  if (b) {
    cout << e << '\n';
    exit(0);
  }
}
template <class T>
T divup(T x, T y) {
  return (x + (y - 1)) / y;
}
template <typename T>
T pow(T a, long long n, T e = 1) {
  T ret = e;
  while (n) {
    if (n & 1) ret *= a;
    a *= a;
    n >>= 1;
  }
  return ret;
}
struct iofast {
  iofast() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
  }
} iofast_;
const int inf = 1e9;
const ll INF = 1e18;
std::vector<int> PF(long long n) {
  std::vector<int> divisor;
  long long upplim = sqrt(n);
  for (int i = 2; i <= upplim + 1; i++) {
    if (n % i) continue;
    while (n % i == 0) {
      n /= i;
      divisor.push_back(i);
    }
  }
  if (n != 1) divisor.push_back(n);
  return divisor;
}
int main() {
  ll n, m, k;
  INPUT(n, m, k);
  if (n * m * 2 % k) {
    YES(0);
    return 0;
  }
  ll a = n, d = m;
  if (k % 2) {
    auto vec = PF(k);
    for (auto v : vec) {
      if (a % v == 0)
        a /= v;
      else
        d /= v;
    }
    (void(0));
    if (a * 2 <= n)
      a *= 2;
    else
      d *= 2;
  } else {
    k /= 2;
    auto vec = PF(k);
    for (auto v : vec) {
      if (a % v == 0)
        a /= v;
      else
        d /= v;
    }
  }
  YES(1);
  cout << "0 0\n"
       << a << " 0\n"
       << "0 " << d << '\n';
  return 0;
}
