#include <bits/stdc++.h>
using namespace std;
int t, n;
pair<pair<int, int>, int> box[200000];
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    n = 2 * n - 1;
    long long sum = 0, oddsum = 0;
    for (int i = 0; i < n; i++) {
      cin >> box[i].first.first >> box[i].first.second;
      box[i].second = i + 1;
      sum += box[i].first.second;
    }
    sort(box, box + n);
    cout << "YES" << endl;
    for (int i = 0; i < n; i += 2) oddsum += box[i].first.second;
    if (2LL * oddsum >= sum) {
      for (int i = 0; i < n; i += 2) cout << box[i].second << " ";
    } else {
      for (int i = 1; i < n; i += 2) cout << box[i].second << " ";
      cout << box[n - 1].second;
    }
    cout << endl;
  }
  return 0;
}
