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.
for _ in range(int(input())):
    N = int(input())
    a = []
    o = []
    apple = 0
    orange = 0
    answers = []
    A = 0
    O = 0
    for _ in range(2*N-1):
        x,y = map(int,input().split())
        a.append(x)
        o.append(y)
        A += x
        O += y
    A /= 2*N
    O /= 2*N
    x = []
    y = []
    for i in range(2*N-1):
        a[i] -= A
        o[i] -= O
        if a[i] < 0 and o[i] < 0:
            continue
        if a[i] < 0:
            x.append((a[i],o[i],i))
        elif o[i] < 0:
            y.append((o[i],a[i],i))
        else:
            answers.append(i+1)
            apple += a[i]
            orange += o[i]
    x = sorted(x,key=lambda x: x[0])
    y = sorted(y,key=lambda x: x[0])
    apple1 = [0]*(len(x)+1)
    orange1 = [0]*(len(x)+1)
    apple2 = [0]*(len(y)+1)
    orange2 = [0]*(len(y)+1)
    for i in range(1,len(x)+1):
        apple1[i] = apple1[i-1]+x[i-1][0]
        orange1[i] = orange1[i-1]+x[i-1][1]
    for i in range(1,len(y)+1):
        apple2[i] = apple2[i-1]+y[i-1][1]
        orange2[i] = orange2[i-1]+y[i-1][0]
    for i in range(min(N-len(answers),len(x))+1):
        m = N-len(answers)-i
        if 0 <= m <= len(y) and apple1[i]+apple2[m]+apple > 0 and orange+orange2[m]+orange1[i] > 0:
            for j in range(i):
                answers.append(x[j][2])
            for j in range(m):
                answers.append(y[j][2])
            break
    if len(answers) < N:
        print('NO')
    else:
        print('YES\n'+' '.join(map(str,answers[:N])))