#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
const ll inf = ll(1e18);
const double PI = acos(-1), eps = 1e-9;
const int mxn = 1e5, mxa = 1e9;
int n, a[2 * mxn], o[2 * mxn], ar[2 * mxn];
bool cmp(const int &x, const int &y) { return a[x] < a[y]; }
void solve() {
  cin >> n;
  int N = 2 * n - 1;
  ll sa = 0, so = 0;
  for (int i = 0; i < N; ++i) {
    cin >> a[i] >> o[i];
    sa += a[i];
    so += o[i];
    ar[i] = i;
  }
  sort(ar, ar + N, cmp);
  ll s0 = 0, s1 = 0;
  for (int i = 0; i < N; ++i) {
    if (i & 1)
      s1 += o[ar[i]];
    else
      s0 += o[ar[i]];
  }
  cout << "YES\n";
  if (s0 * 2 >= so) {
    for (int i = 0; i < N; i += 2) cout << ar[i] + 1 << ' ';
  } else {
    for (int i = 1; i < N; i += 2) cout << ar[i] + 1 << ' ';
    cout << ar[N - 1] + 1;
  }
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
