#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 2e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t, tc = 0;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<pair<int, int> > a(n + n - 1);
    for (auto &qq : a) cin >> qq.first >> qq.second;
    vector<int> v(n + n - 1);
    iota((v).begin(), (v).end(), 0);
    sort((v).begin(), (v).end(), [&](int &p, int &q) { return a[p] < a[q]; });
    long long tf = 0, ts = 0;
    for (auto &qq : a) tf += qq.first, ts += qq.second;
    long long oddf = 0, odds = 0;
    for (int i = 0; i < (int)v.size(); i += 2) {
      oddf += a[v[i]].first;
      odds += a[v[i]].second;
    }
    if (oddf + oddf >= tf and odds + odds >= ts) {
      cout << "YES\n";
      for (int i = 0; i < (int)v.size(); i += 2) {
        if (i) cout << " ";
        cout << v[i] + 1;
      }
      cout << "\n";
    } else {
      long long evef = tf - oddf + a[v.back()].first,
                eves = ts - odds + a[v.back()].second;
      if (evef * 2 >= tf and eves * 2 >= ts) {
        cout << "YES\n";
        for (int i = 1; i < (int)v.size(); i += 2) {
          if (i > 1) cout << " ";
          cout << v[i] + 1;
        }
        cout << " " << v.back() + 1 << "\n";
      } else
        cout << "NO\n\n";
    }
  }
  return 0;
}
