#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e5 + 85 - 69;
pair<pair<long long, long long>, long long> A[maxn];
bool mark[maxn];
vector<long long> ans;
int main() {
  long long T;
  cin >> T;
  while (T--) {
    long long n, se = 0, go = 0;
    cin >> n;
    for (long long i = 0; i < 2 * n - 1; i++)
      cin >> A[i].first.first >> A[i].first.second, A[i].second = i;
    sort(A, A + (2 * n - 1));
    cout << "YES\n";
    for (long long i = 0; i < 2 * n - 2; i++)
      se += (i % 2 ? A[i].first.second : 0),
          go += (i % 2 ? 0 : A[i].first.second);
    long long i = 0;
    cout << A[2 * n - 2].second + 1 << ' ';
    if (se > go) i++;
    for (i; i < 2 * n - 2; i += 2) cout << A[i].second + 1 << ' ';
    cout << endl;
  }
}
