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.
#! python3

T = int(input())
while T > 0:
    N = int(input())
    boxes = []
    apples = 0
    oranges = 0
    for i in range(2*N-1):
        boxes.append([int(x) for x in input().strip().split(' ')])
        apples += boxes[-1][0] 
        oranges += boxes[-1][1]   
    boxes.sort(key=lambda x: x[0])
    odd_apples = 0
    for i in range(0, 2*N-1, 2):
        odd_apples += boxes[i][1]
    print('YES')
    if odd_apples * 2 >= apples:
        print(' '.join([str(x+1) for x in range(0, 2*N-1, 2)]))
    else:
        print(' '.join([str(x+1) for x in range(0, 2*N-1, 2)]) + ' ' + str(2*N-1))
    T -= 1