In 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.
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*<sub class="lower-index">*i*</sub> and *o*<sub class="lower-index">*i*</sub> — amount of apples and oranges in the *i*-th box (0 ≤ *a*<sub class="lower-index">*i*</sub>, *o*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>). The sum of *N* in all the tests in the input doesn't exceed 10<sup class="upper-index">5</sup>. All the input numbers are integer.
from sys import stdin
# read = sys.stdin.readline
T = int(stdin.readline())
for _ in range(T):
    N = int(stdin.readline())
    M = N + N - 1
    data = [ ]
    for i in range(M):
        data.append([int(w) for w in stdin.readline().split()] + [i + 1])
    data.sort(reverse=True)
    # print(data)
    total = sum(d[1] for d in data)
    half = sum(d[1] for d in data[0::2])
    print('YES')
    result = []
    if half + half >= total:
        result.extend([d[2] for d in data[0::2]])
    else:
        result.append(data[0][2])
        result.extend([d[2] for d in data[1::2]])
    print(*result)