#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  for (int tc = 1; tc <= t; tc++) {
    int n;
    cin >> n;
    pair<pair<int, int>, int> arr[2 * n - 1];
    for (int i = 0; i < 2 * n - 1; i++) {
      cin >> arr[i].first.first >> arr[i].first.second;
      arr[i].second = i;
    }
    sort(arr, arr + 2 * n - 1);
    long long odd = 0, even = 0;
    for (int i = 0; i < 2 * n - 1; i++) {
      if (i & 1)
        even += arr[i].first.second;
      else
        odd += arr[i].first.second;
    }
    if (odd >= even) {
      cout << "YES\n";
      int ans[n];
      for (int i = 0; i < 2 * n - 1; i += 2) ans[i / 2] = arr[i].second + 1;
      sort(ans, ans + n);
      for (int i = 0; i < n - 1; i++) cout << ans[i] << ' ';
      cout << ans[n - 1] << '\n';
    } else {
      cout << "YES\n";
      int ans[n];
      for (int i = 1; i < 2 * n - 1; i += 2) ans[i / 2] = arr[i].second + 1;
      ans[n - 1] = arr[2 * n - 2].second + 1;
      sort(ans, ans + n);
      for (int i = 0; i < n - 1; i++) cout << ans[i] << ' ';
      cout << ans[n - 1] << '\n';
    }
  }
}
