#include <bits/stdc++.h>
using namespace std;
long long poww(long long a, long long b, long long md) {
  return (!b ? 1
             : (b & 1 ? a * poww(a * a % md, b / 2, md) % md
                      : poww(a * a % md, b / 2, md) % md));
}
const long long MAXN = 1e6 + 10;
const long long INF = 8e18;
const long long MOD = 1e9 + 7;
vector<pair<pair<long long, long long>, int>> v;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    v.clear();
    int n;
    cin >> n;
    n = n * 2 - 1;
    v.resize(n);
    for (int i = 0; i < n; i++)
      cin >> v[i].first.first >> v[i].first.second, v[i].second = i + 1;
    sort((v).begin(), (v).end(),
         greater<pair<pair<long long, long long>, int>>());
    vector<int> ans = {v.front().second};
    for (int i = 1; i < n; i += 2) {
      if (v[i].first.second < v[i + 1].first.second)
        ans.push_back(v[i + 1].second);
      else
        ans.push_back(v[i].second);
    }
    sort((ans).begin(), (ans).end());
    cout << "YES" << '\n';
    for (int e : ans) cout << e << ' ';
    cout << '\n';
  }
  return 0;
}
