CF23C Oranges and Apples

In $ 2N-1 $ boxes there are apples and oranges. Your task is to choose $ N $ boxes so, that they will contain not less than half of all the apples and not less than half of all the oranges.

The first input line contains one number $ T $ — amount of tests. The description of each test starts with a natural number $ N $ — amount of boxes. Each of the following $ 2N-1 $ lines contains numbers $ a_{i} $ and $ o_{i} $ — amount of apples and oranges in the $ i $ -th box ( $ 0

For each test output two lines. In the first line output YES, if it's possible to choose $ N $ boxes, or NO otherwise. If the answer is positive output in the second line $ N $ numbers — indexes of the chosen boxes. Boxes are numbered from 1 in the input order. Otherwise leave the second line empty. Separate the numbers with one space.