#include <bits/stdc++.h>
using namespace std;
long long T;
long long n;
struct nod {
  long long a, b, id;
} e[200000 + 20];
long long sumb = 0;
long long q[200000 + 20];
long long tot = 0;
bool cmp(nod a, nod b) { return a.a < b.a; }
int main() {
  scanf("%I64d", &T);
  while (T) {
    sumb = 0;
    tot = 0;
    scanf("%I64d", &n);
    long long k = 2 * n - 1;
    for (long long i = 1; i <= k; i++) {
      scanf("%I64d%I64d", &e[i].a, &e[i].b);
      e[i].id = i;
      sumb += e[i].b;
    }
    sort(e + 1, e + k + 1, cmp);
    printf("YES\n");
    long long res = 0;
    for (long long i = 1; i <= k; i += 2) res += e[i].b;
    if (2 * res >= sumb) {
      for (long long i = 1; i <= k; i += 2) {
        q[++tot] = e[i].id;
      }
    } else {
      q[++tot] = e[k].id;
      for (long long i = 2; i <= k - 1; i += 2) {
        q[++tot] = e[i].id;
      }
    }
    sort(q + 1, q + tot + 1);
    for (long long i = 1; i <= tot; i++) printf("%I64d ", q[i]);
    printf("\n");
    T--;
  }
  return 0;
}
