#include <bits/stdc++.h>
using namespace std;
struct box {
  long long a, o;
  int num;
} B[200010];
long long n, t;
inline long long read() {
  long long cnt = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    cnt = cnt * 10 + ch - 48;
    ch = getchar();
  }
  return cnt * f;
}
inline bool cmp(box x, box y) { return x.a < y.a; }
int main() {
  t = read();
  while (t--) {
    n = read();
    for (int i = 1; i <= 2 * n - 1; i++) {
      B[i].num = i;
      B[i].a = read();
      B[i].o = read();
    }
    sort(B + 1, B + 1 + 2 * n - 1, cmp);
    puts("YES");
    for (int i = 1; i < n * 2 - 1; i += 2) {
      if (B[i].o < B[i + 1].o)
        printf("%d ", B[i + 1].num);
      else
        printf("%d ", B[i].num);
    }
    printf("%d\n", B[n * 2 - 1].num);
  }
  return 0;
}
