#include <bits/stdc++.h>
using namespace std;
struct box {
  int fir, sec, num;
  bool operator<(const box &b) const {
    if (b.fir == fir) {
      return sec < b.sec;
    } else
      return fir < b.fir;
  }
} e[200000 + 5];
int main() {
  int n;
  scanf("%d", &n);
  while (n--) {
    int t;
    for (int i = 1; i < 20000 + 5; i++) {
      e[i].fir = 0;
      e[i].sec = 0;
      e[i].num = 0;
    }
    scanf("%d", &t);
    int lim = t;
    t = t * 2 - 1;
    for (int i = 1; i <= t; i++) {
      scanf("%d%d", &e[i].fir, &e[i].sec);
      e[i].num = i;
    }
    sort(e + 1, e + t + 1);
    printf("YES\n");
    for (int i = 1; i < lim; i++) {
      int a = i * 2;
      int b = a - 1;
      if (e[a].sec > e[b].sec)
        printf("%d ", e[a].num);
      else
        printf("%d ", e[b].num);
    }
    printf("%d\n", e[t].num);
  }
  return 0;
}
