#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<pair<pair<int, int>, int> > a(2 * n - 1);
    for (int i = 0; i < 2 * n - 1; i++) {
      cin >> a[i].first.first;
      cin >> a[i].first.second;
      a[i].second = i + 1;
    }
    sort(a.begin(), a.end());
    long long s = 0, s1 = 0, tt = 0, tt1 = 0;
    for (int i = 0; i < 2 * n - 1; i++) {
      if (i % 2 == 0) {
        s += a[i].first.first;
        s1 += a[i].first.second;
      }
      tt += a[i].first.first;
      tt1 += a[i].first.second;
    }
    tt++;
    tt1++;
    tt /= 2;
    tt1 /= 2;
    cout << "YES" << endl;
    if (s >= tt && s1 >= tt1) {
      for (int i = 0; i < 2 * n - 1; i++) {
        if (i % 2 == 0) cout << a[i].second << " ";
      }
      cout << endl;
    } else {
      for (int i = 0; i < 2 * n - 1; i++) {
        if (i % 2 == 1) {
          cout << a[i].second << " ";
        }
      }
      cout << a[2 * n - 2].second << endl;
    }
  }
  return 0;
}
