#include <bits/stdc++.h>
using namespace std;
const long long N = 5e6 + 10;
const double Pi = acos(-1);
inline long long read() {
  long long x = 0, f = 1, ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
  return x * f;
}
long long Case, n;
struct Node {
  long long a, b, id;
} o[N];
bool cmp(Node x, Node y) { return x.a < y.a; }
signed main() {
  Case = read();
  while (Case--) {
    n = read();
    for (register long long i = 1; i <= n * 2 - 1; ++i)
      o[i].a = read(), o[i].b = read(), o[i].id = i;
    sort(o + 1, o + n * 2, cmp);
    puts("YES");
    for (long long i = 2; i <= n * 2 - 1; i += 2) {
      if (o[i].b > o[i - 1].b)
        printf("%lld ", o[i].id);
      else
        printf("%lld ", o[i - 1].id);
    }
    printf("%lld\n", o[n * 2 - 1].id);
  }
  return 0;
}
