Technocup 2019 - Elimination Round 1
D
Vasya and Triangle
Codeforces
1800
原题
← CE →
翻译中…

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 \le x_1, x_2, x_3 \le n$, $0 \le y_1, y_2, y_3 \le m$ and the area of the triangle formed by these points is equal to $\frac{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\le n, m \le 10^9$, $2 \le k \le 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).

翻译中…

Note

翻译中…

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

翻译中…

image

翻译中…

In the second example there is no triangle with area $\frac{nm}{k} = \frac{16}{7}$.

翻译中…

样例

Input #1
4 3 3
Output #1
YES
1 0
2 3
4 1
InputCopy OutputCopy
Input #2
4 4 7
Output #2
NO
InputCopy OutputCopy
题目信息
题号
1030D
时间限制
1 s
内存限制
256 MB
标签
计算几何
数论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。