#include <bits/stdc++.h>

using namespace std;

 long long n,m,k,area,a,b;
vector<pair<long long,long long> >div1,div2;
 void done(long long x,long long y){
    cout<<"YES\n";
    cout<<"0 0\n";
    cout<<0<<" "<<y<<"\n";
    cout<<x<<" "<<1;
}
bool can(long long x,long long y){
    return x >=0 && x<= n && y>=0 && y<=m;
}
long long int gcd(long long int a,long long int b){
    return !a ? b: gcd(b%a,a);
}
int main()
{
   long long int n,m,k;
    cin>>n>>m>>k;
    if((2*n*m)%k){
        return cout<<"NO",0;
    }
    cout<<"YES\n";
    cout<<"0 0\n";
    if(k%2 == 0){
        k/=2;
        long long int g = gcd(n,k);
        cout<<n/g<<" "<<0<<endl;
        cout<<0<<" "<<(m/(k/g));
        return 0;
    }
    long long int gg = gcd(n,k);
    if(gg == 1)m*=2;
    else n*=2;
    cout<<n/gg<<" "<<0<<endl;
        cout<<0<<" "<<(m/(k/gg));
    return 0;
}