#include <bits/stdc++.h>
using namespace std;
int cond = 1;
pair<pair<int, int>, int> t[201013];
set<pair<int, int> > s;
vector<int> ret;
int czy[201013];
int main() {
  int dd;
  scanf("%d", &dd);
  while (dd--) {
    int n;
    scanf("%d", &n);
    n = n + n - 1;
    for (int i = 0; i < (n); i++) {
      scanf("%d %d", &t[i].first.first, &t[i].first.second);
      t[i].second = i + 1;
      czy[i + 1] = 1;
    }
    sort(t, t + n);
    s.clear();
    ret.clear();
    set<pair<int, int> >::iterator q;
    for (int i = 0; i < (n); i++) {
      q = s.insert(make_pair(t[i].first.second, t[i].second)).first;
      if (q != s.begin()) {
        ret.push_back(t[i].second);
        czy[t[i].second] = 0;
        czy[s.begin()->second] = 0;
        s.erase(q);
        s.erase(s.begin());
      }
    }
    int ok = 1;
    for (int i = 0; i < (n); i++)
      if (czy[t[i].second]) {
        if (ok) ret.push_back(t[i].second);
        ok = 1 - ok;
      }
    puts("YES");
    for (__typeof((ret).begin()) i = ((ret).begin()); i != (ret).end(); ++i)
      printf("%d ", *i);
    puts("");
  }
  return 0;
}
