#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
  x = 0;
  char ch = getchar();
  long long fh = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') fh = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  x *= fh;
}
template <typename T>
void write(T x) {
  if (x < 0) x = -x, putchar('-');
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
template <typename T>
void writeln(T x) {
  write(x);
  puts("");
}
long long n;
pair<pair<long long, long long>, long long> a[200005];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long tc;
  cin >> tc;
  while (tc--) {
    cin >> n;
    long long suma = 0, sumo = 0;
    for (long long i = 1; i <= 2 * n - 1; i++) {
      cin >> a[i].first.first >> a[i].first.second;
      suma += a[i].first.first;
      sumo += a[i].first.second;
      a[i].second = i;
    }
    sort(a + 1, a + 2 * n);
    vector<long long> id;
    long long apple = a[2 * n - 1].first.first,
              orange = a[2 * n - 1].first.second;
    for (long long i = 1; i <= n - 1; i++) {
      if (a[2 * i - 1].first.second > a[2 * i].first.second) {
        apple += a[2 * i - 1].first.first;
        orange += a[2 * i - 1].first.second;
        id.push_back(a[2 * i - 1].second);
      } else {
        apple += a[2 * i].first.first;
        orange += a[2 * i].first.second;
        id.push_back(a[2 * i].second);
      }
    }
    id.push_back(a[2 * n - 1].second);
    if (apple * 2 >= suma && orange * 2 >= sumo) {
      cout << "YES" << endl;
      for (long long i = 0; i < id.size(); i++) cout << id[i] << ' ';
      cout << endl;
    } else {
      cout << "NO" << endl;
      return 0;
    }
  }
  return 0;
}
