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.
t=int(input())
ans=[]
for _ in range(t):
    n=int(input())
    boxes=[]
    for no in range(1, 2*n):
        boxes.append(list(map(int, input().split()))+[no])
    if(n==1):
        ans.append([1])
    else:
        boxes.sort()
        odd_sm, total = boxes[0][1], boxes[0][1]
        odd, even = [boxes[0][2]], []
        for idx in range(3, 2*n, 2):
            odd_sm+=boxes[idx-1][1]
            total+=boxes[idx-1][1]+boxes[idx-2][1]
            odd+=[boxes[idx-1][2]]
            even+=[boxes[idx-2][2]]
        if(2*odd_sm>=total):
            ans.append(odd)
        else:
            ans.append(even+[2*n-1])       
for idx in range(t):
    print('YES')
    for no in ans[idx]:
        print(no, end=' ')
    print(end='\n')