Problem
Tenyearold Tangor has just discovered how to compute the area of a triangle. Being a bright boy, he is amazed by how many different ways one can compute the area. He also convinced himself that, if all the points of the triangle have integer coordinates, then the triangle's area is always either an integer or half of an integer! Isn't that nice?
But today Tangor is trying to go in the opposite direction. Instead
of taking a triangle and computing its area, he is taking an integer A and trying to draw a triangle of area
More precisely, the sheet of graph paper is divided into an
Given the integer A, help Tangor find three integer points on
the sheet of graph paper such that the area of the triangle formed by
those points is exactly
Input
One line containing an integer C, the number of test cases in the input file.
The next C lines will each contain three integers N, M, and A, as described above.
Output
For each test case, output one line. If there is no way to satisfy the condition, output
Case #k: IMPOSSIBLEwhere k is the case number, starting from 1. Otherwise, output
Case #k: x_{1} y_{1} x_{2} y_{2} x_{3} y_{3}where k is the case number and (x_{1}, y_{1}), (x_{2}, y_{2}), (x_{3}, y_{3}) are any three integer points on the graph paper that form a triangle of area A/2.
Limits
0 ≤ C ≤ 1000
1 ≤ A ≤ 10^{8}
Small dataset
1 ≤ N ≤ 50
1 ≤ M ≤ 50
Large dataset
1 ≤ N ≤ 10000
1 ≤ M ≤ 10000
Sample
Input 
Output 
3

Case #1: 0 0 0 1 1 1
