#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int n, m, k;
int gcd(int a, int b)
{
	while (b != 0)
	{
		int tmp = a;
		a = b;
		b = tmp % b;
	}
	return a;
}
int main()
{
	//	freopen("bout.txt","w",stdout);

	scanf("%d%d%d", &n, &m, &k);
	printf("%d %d %d \n",n,m,k);
	int s = n * m / k * 2;
	if (n * m * 2 % k != 0)
	{
	printf("%d %d %d %d \n",n,m,k,n * m * 2 % k);
		printf("\\NO");
		return 0;
	}
	int n1 = gcd(k, n), m1 = gcd(k / n1, m);
	int n2 = n / n1, m2 = m / m1;
	if (n2 * m2 / 2 * 2 == s) //*2因为开始时s*=2;
	{
		printf("YES\n0 0\n%d 0\n0 %d", n2, m2);
	}
	else if (n2 * 2 <= n)
	{
		printf("YES\n0 0\n%d 0\n0 %d", n2 * 2, m2);
	}
	else
	{
		printf("YES\n0 0\n%d 0\n0 %d", n2, m2 * 2);
	}
	return 0;
}