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())
for z in range(t):
    n=int(input())
    s1=0
    s2=0
    l1=[]
    l2=[]
    
    for i in range(2*n-1):
        a,b=map(int,input().split())
        s1+=a/2
        s2+=b/2
        l1.append((a,i))
        l2.append((b,i))
    l3=l1[:]
    l4=l2[:]
    l3.sort(key=lambda x: x[0])
    l4.sort(key=lambda x: x[0])
    
    
    
    l3.reverse()
    l4.reverse()
    l5=[]
    l6=[]
    for i in range(2*n-1):
        l5.append(l3[i][1])
        l6.append(l4[i][1])
    l7=[]
    i=0
    while i<n:

        l7.append(l5[0])
        
        l6.remove(l5[0])
        l5.pop(0)
        i+=1
        if i<n:
            l7.append(l6[0])
            
            l5.remove(l6[0])
            l6.pop(0)
            i+=1
    d1=0
    d2=0
    for i in range(n):
        d1+=l1[l7[i]][0]
        
        d2+=l2[l7[i]][0]
    if d1<s1 or d2<s2:
        print("NO")
    else:
        print("YES")
        for i in range(n):
            print(l7[i]+1,end=" ")
        print()
        
    
    
        
    

    
    


        
    
    
