Problem: In 2N - 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.

Input

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 2N - 1 lines contains numbers ai and oi — amount of apples and oranges in the i-th box (0 ≤ ai, oi ≤ 109). The sum of N in all the tests in the input doesn't exceed 105. All the input numbers are integer.

Output

For each test output two lines. In the first line output YES, if it's possible to choose N boxes, or NO otherwise. If the answer is positive output in the second line N numbers — indexes of the chosen boxes. Boxes are numbered from 1 in the input order. Otherwise leave the second line empty. Separate the numbers with one space.

Examples

Input

2
2
10 15
5 7
20 18
1
0 0


Output

YES
1 3
YES
1

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class C {
    public static void main(String[] args) throws IOException {
        new C().solve();
    }

    StringTokenizer st = new StringTokenizer("");
    BufferedReader br;

    private void solve() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));

        PrintWriter pw = new PrintWriter(System.out);
        int nt = nextInt();
        for (int i = 0; i < nt; i++) {
            subsolve(pw);
        }
        pw.close();
    }

    private void subsolve(PrintWriter pw) throws IOException {
        int n = nextInt();
        E[] es = new E[2 * n - 1];
        long osum = 0;
        long asum = 0;
        for (int i = 0; i < 2 * n - 1; i++) {
            int a = nextInt();
            int o = nextInt();
            es[i] = new E(a, o, i + 1);
            osum += o;
            asum += a;
        }
        Arrays.sort(es);
        E common = es[0];
        long o1 = 0;
        long a1 = 0;
        int n1 = 0;
        for (int i = 1; i < 2 * n - 1; i += 2) {
            o1 += es[i].o;
            a1 += es[i].a;
            n1++;
        }
        if (n1 != n - 1) {
            throw new RuntimeException("n != n1");
        }
        if (2 * (a1 + common.a) < asum) {
            throw new RuntimeException("a1");
        }
        if (2 * (asum - a1) < asum) {
            throw new RuntimeException("a2");
        }
        if (2 * (o1 + common.o) < osum && 2 * (osum - o1) < osum) {
            throw new RuntimeException("o");
        }
        int startInd = 2 * (o1 + common.o) >= osum ? 1 : 2;
        pw.println("YES");
        pw.print(common.id);
        for (int i = startInd; i < 2 * n - 1; i += 2) {
            pw.print(" ");
            pw.print(es[i].id);
        }
        pw.println();
    }

    String nextToken() throws IOException {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    static class E implements Comparable<E> {
        final int id;
        final long a;
        final long o;

        E(int a, int o, int id) {
            this.id = id;
            this.a = a;
            this.o = o;
        }

        public int compareTo(E o) {
            return (int) (o.a - this.a);
        }
    }

}