solve in c or any language

The first line of input contains the number of test casesT(1T11

) . The descriptions of the test cases follow:

Each test case consists of one line containing the number of wheelsn

(1n1000) . Each of the following lines contain three integersx,yandr(10000x,y10000;1r10000) where(x,y)denote the Cartesian coordinates of the wheels center andr

is its radius.

Output

For each test case, outputn

lines, each describing the movement of one wheel, in the same order as in the input. For every wheel, output eitherp/qclockwiseorp/qcounterclockwise, where the irreducible fractionp/qis the number of wheel turns per minute. Ifqis1, output justp

as an integer. If a wheel is standing still, outputnot moving.

Sample Input 1Sample Output 11 5 0 0 6 6 8 4 -9 0 3 6 16 4 0 -11 4 1 clockwise 3/2 counterclockwise 2 counterclockwise 3/2 clockwise not moving