#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
struct node {
  int id, a, b;
} ask[maxn * 2];
inline bool cmp(node a, node b) { return a.a < b.a; }
int t, n;
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    long long sum = 0;
    long long ans = 0;
    for (int i = 1; i <= 2 * n - 1; i++) {
      ask[i].id = i;
      scanf("%d%d", &ask[i].a, &ask[i].b);
      sum += ask[i].b;
    }
    sort(ask + 1, ask + 2 * n, cmp);
    printf("YES\n");
    for (int i = 1; i < 2 * n; i += 2) ans += ask[i].b;
    if (ans * 2 >= sum) {
      for (int i = 1; i < 2 * n; i += 2) printf("%d ", ask[i].id);
    } else {
      for (int i = 2; i < 2 * n; i += 2) printf("%d ", ask[i].id);
      printf("%d", ask[2 * n - 1].id);
    }
    printf("\n");
  }
  return 0;
}
