#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
int n;
int m;
int p[200000], x[200000], y[200000];
bool myless(int i, int j) { return x[i] > x[j] || x[i] == x[j] && i < j; }
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &m);
    m = m * 2 - 1;
    for (int j = 0; j < m; j++) {
      scanf("%d%d", &x[j], &y[j]);
      p[j] = j;
    }
    sort(p, p + m, myless);
    long long s[2];
    s[0] = s[1] = 0;
    for (int j = 1; j < m; j++) s[j & 1] += y[p[j]];
    int r = 0;
    if (s[1] > s[0]) r = 1;
    printf("YES\n");
    printf("%d", p[0] + 1);
    for (int j = 2 - r; j < m; j += 2) printf(" %d", p[j] + 1);
    printf("\n");
  }
  return 0;
}
