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 i in range(t):
    n=int(input())
    app=[];ora=[];apps=ors=0
    for j in range(2*n-1):
        a,o=map(int,input().split())
        apps+=a;ors+=o
        app.append([a,o,j+1]);ora.append([o,j+1])
    app.sort(reverse=True);ora.sort(reverse=True)
    apps=-(-apps//2);ors=-(-ors//2)
    s=set()
    for j in range(n):
        s.add(app[j][2])
        apps-=app[j][0];ors-=app[j][1]
        if apps<=0:
            break
    for j in range(2*n-1):
        if len(s)==n:break
        if ora[j][1] not in s:
            s.add(ora[j][1])
            ors-=ora[j][0]
    if ors<=0 and apps<=0 and len(s)==n:
        print('YES')
        print(*list(s))
    else:
        print('NO')
    