#include <bits/stdc++.h>
using namespace std;
const long long N = 200010;
const long long M = 50010;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long t, n, now, sum;
struct node {
  long long apple, oranges, seat;
};
node a[N];
long long cmp(node a, node b) { return a.oranges < b.oranges; }
signed main() {
  t = read();
  while (t--) {
    sum = now = 0;
    n = read();
    for (long long i = 1; i <= n * 2 - 1; i++) {
      a[i].apple = read(), a[i].oranges = read();
      a[i].seat = i;
      sum += a[i].apple;
    }
    sort(a + 1, a + 2 * n, cmp);
    for (long long i = 1; i <= n * 2 - 1; i += 2) now += a[i].apple;
    printf("YES\n");
    if (now * 2 >= sum) {
      for (long long i = 1; i <= n * 2 - 1; i += 2) printf("%d ", a[i].seat);
      printf("\n");
    } else {
      for (long long i = 2; i <= n * 2 - 2; i += 2) printf("%d ", a[i].seat);
      printf("%d\n", a[n * 2 - 1].seat);
    }
  }
  return 0;
}
