#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 100 * 2 + 20;
long long n;
pair<pair<long long, long long>, int> arr[MAXN];
int main() {
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    n += n - 1;
    for (int i = 0; i < n; i++)
      cin >> arr[i].first.first >> arr[i].first.second, arr[i].second = i + 1;
    sort(arr, arr + n);
    cout << "YES" << endl;
    for (int i = 0; i < (n - 1) / 2; i++) {
      if (arr[2 * i].first.second < arr[2 * i + 1].first.second)
        cout << arr[2 * i + 1].second << ' ';
      else
        cout << arr[2 * i].second << ' ';
    }
    cout << arr[n - 1].second << endl;
  }
  return 0;
}
