#include <bits/stdc++.h>
using namespace std;
struct box {
  int a, o, id;
  bool operator<(const box &b) const {
    if (a != b.a) return a > b.a;
    if (o != b.o) return o > b.o;
    return id < b.id;
  }
};
box b[200005];
int n, N;
void solve() {
  scanf("%d", &n);
  N = 2 * n - 1;
  for (int i = 0; i < N; ++i) {
    b[i].id = i + 1;
    scanf("%d%d", &b[i].a, &b[i].o);
  }
  sort(b, b + N);
  printf("YES\n%d", b[0].id);
  long long sumo = 0, allo = 0;
  for (int i = 0; i < n; ++i) sumo += b[2 * i].o;
  for (int i = 0; i < N; ++i) allo += b[i].o;
  if (sumo * 2 >= allo) {
    for (int i = 1; i < n; ++i) printf(" %d", b[2 * i].id);
  } else {
    for (int i = 1; i < n; ++i) printf(" %d", b[2 * i - 1].id);
  }
  printf("\n");
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
  return 0;
}
