#include <bits/stdc++.h>
using namespace std;
const int sh = 1e6;
const int ppr = 257;
const long long INF = 1e18;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int N = 2e5 + 123;
const long double pi = 3.141592653589793238462643;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int pp[] = {-1, 257, 263};
const int md[] = {-1, int(1e9 + 7), int(1e9 + 9)};
long long t, n, e, o;
pair<pair<long long, long long>, int> p[N];
void solve() {
  n = e = o = 0;
  cin >> n;
  n = n + n - 1;
  for (int i = 1; i <= n; i++) {
    cin >> p[i].first.first >> p[i].first.second;
    p[i].second = i;
    e += p[i].first.second;
  }
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= n; i++)
    if (i % 2) o += p[i].first.second;
  cout << "YES\n";
  if (o * 2 >= e)
    for (int i = 1; i <= n; i += 2) cout << p[i].second << ' ';
  else {
    for (int i = 2; i <= n; i += 2) cout << p[i].second << ' ';
    cout << p[n].second;
  }
  cout << '\n';
}
int main() {
  cin >> t;
  while (t--) solve();
  return 0;
}
