#include <bits/stdc++.h>
using namespace std;
const int N = int(3e5), mod = int(1e9) + 7;
int a[N], b[N], n, p[N], m, t;
bool cmp(int i, int j) { return a[i] < a[j]; }
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    m = 2 * n - 1;
    long long second = 0, sb = 0;
    for (int i = 1; i <= m; i++) {
      scanf("%d%d", &a[i], &b[i]);
      p[i] = i;
      sb += b[i];
    }
    sort(p + 1, p + m + 1, cmp);
    for (int i = 1; i <= m; i += 2) {
      second += b[p[i]];
    }
    puts("YES");
    if (2 * second >= sb) {
      for (int i = 1; i <= m; i += 2) {
        printf("%d ", p[i]);
      }
      printf("\n");
    } else {
      for (int i = 2; i <= m; i += 2) {
        printf("%d ", p[i]);
      }
      printf("%d\n", p[m]);
    }
  }
  return 0;
}
