Oranges and Apples

已知有 $2N-1$ 个箱子，每个箱子里有一些苹果和橘子。你的任务是从中选择 $N$ 个箱子使得这 $N$ 个箱子中的苹果数目不小于所有箱子里苹果总数的一半，这 $N$ 个箱子中的橘子数目也不小于所有箱子里橘子总数的一半。 输入格式：第一行一个整数 $t$，表示数据组数，之后对于每组数据先有一个整数 $N$，后 $2N-1$ 行每行两个整数代表该箱子中苹果和橘子的数量。 输出格式：对于每组数据，若不存在合法方案则输出 `NO`，否则输出 `YES`，并在下面的 $N$ 行输出选择箱子的编号（编号从 $1$ 开始） Translated by 稀神探女

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<=a_{i},o_{i}<=10^{9} $ ). The sum of $ N $ in all the tests in the input doesn't exceed $ 10^{5} $ . All the input numbers are integer.

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.

2
2
10 15
5 7
20 18
1
0 0

YES
1 3
YES
1