SP202 ROCKETS - Rockets

There are two separate, _n_-element sets of points of a two dimensional map: **R** and **W**. None triple of points from the set **R**U**W** is collinear. Rockets earth-to-earth are located on points from the set **R**. Enemy objects, which should be destroyed, are located on points from the set **W**. The rockets may fly only in the straight line and their trajectories cannot intersect. We are about to find for each rocket a target to destroy. ### Task Write a program which: - reads from the standard input coordinates of the points from the sets **R** and **W**, - finds the set of _n_ pairwise not-intersecting segments, so that one end of each segment belongs to the set **R**, while the other belongs to the set **W**, - writes the result into the standard output.

The number of test cases t is in the first line of input, then t test cases follow separated by an empty line. In the first line of each test case there is written one integer _n_, _1

The output for each test case should consist of _n_ lines. In the _i_-th line there should be one integer _k(i)_, such that the segment _r $ _{i} $ w $ _{k(i)} $_ belongs to the set of segments which your program found. (This means that the rocket from the point _r $ _{i} $_ destroys an object in the point _w $ _{k(i)} $_ ).