#include <bits/stdc++.h>
using namespace std;
inline bool isvowel(char c) {
  c = tolower(c);
  if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
    return 1;
  return 0;
}
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n;
pair<pair<int, int>, int> a[N];
vector<int> ans;
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  return a.first.first > b.first.first;
}
void Solve() {
  cin >> n;
  for (long long i = 1; i <= n * 2 - 1; i++) {
    cin >> a[i].first.first >> a[i].first.second;
    a[i].second = i;
  }
  ans.clear();
  sort(a + 1, a + n * 2);
  reverse(a + 1, a + n * 2);
  ans.push_back(a[1].second);
  for (long long i = 2; i <= n * 2 - 1; i++) {
    if (i + 1 <= n * 2 - 1 && a[i].first.second >= a[i + 1].first.second) {
      ans.push_back(a[i].second);
    } else
      ans.push_back(a[i + 1].second);
    i++;
  }
  cout << "YES\n";
  sort(ans.begin(), ans.end());
  for (auto it : ans) cout << it << ' ';
  cout << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    Solve();
  }
  return 0;
}
