Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Oranges and Apples

time limit per test

1.5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn 2*N* - 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.

Input

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 2*N* - 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.

Output

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.

Examples

Input

2

2

10 15

5 7

20 18

1

0 0

Output

YES

1 3

YES

1

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/22/2019 20:05:53 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|