#include <bits/stdc++.h>
using namespace std;
struct box {
  long long app;
  long long org;
  long long num;
} s[400005];
bool cmp(box a, box b) { return a.app > b.app; }
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int i;
    for (i = 1; i < 2 * n; i++) {
      scanf("%lld%lld", &s[i].app, &s[i].org);
      s[i].num = i;
    }
    long long s1 = 0, s2 = 0;
    sort(s + 1, s + 2 * n, cmp);
    for (i = 1; i < 2 * n; i++) {
      if (i % 2 == 1)
        s1 = s1 + s[i].org;
      else
        s2 = s2 + s[i].org;
    }
    puts("YES");
    if (s1 >= s2) {
      for (i = 1; i < 2 * n; i += 2) {
        printf("%lld ", s[i].num);
      }
    } else {
      printf("%lld ", s[1].num);
      for (i = 2; i < 2 * n; i += 2) {
        printf("%lld ", s[i].num);
      }
    }
  }
}
