#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
mt19937 rnd(228);
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<pair<long long, long long>> a(2 * n - 1);
    vector<long long> used(2 * n - 1, 0);
    vector<long long> hz(2 * n - 1);
    long long sumappl = 0, sumap = 0;
    for (long long i = 0; i < 2 * n - 1; i++) {
      long long ap, op;
      cin >> ap >> op;
      a[i] = {ap, op};
      sumappl += a[i].first, sumap += a[i].second;
      hz[i] = i;
    }
    sumappl = (sumappl + 1) / 2, sumap = (sumap + 1) / 2;
    long long N = 2 * n - 1;
    bool flag = 0;
    for (long long kkkk = 0; kkkk < 5; kkkk++) {
      if (flag) break;
      shuffle(hz.begin(), hz.end(), rnd);
      vector<long long> sum1(2 * N + 2, 0);
      vector<long long> sum2(2 * N + 2, 0);
      for (long long j = 0; j < 2 * N; j++) {
        sum1[j + 1] = sum1[j] + a[hz[j % N]].first;
        sum2[j + 1] = sum2[j] + a[hz[j % N]].second;
      }
      for (long long j = n - 1; j < 2 * N; j++) {
        long long sum11 = sum1[j + 1] - sum1[j + 1 - n],
                  sum22 = sum2[j + 1] - sum2[j + 1 - n];
        if (sum11 >= sumappl && sum22 >= sumap) {
          flag = 1;
          for (long long k = j; k > j - n; k--) {
            used[hz[k % N]] = 1;
          }
          break;
        }
      }
    }
    if (flag) {
      cout << "YES" << '\n';
      for (long long i = 0; i < 2 * n - 1; i++) {
        if (used[i]) cout << i + 1 << " ";
      }
      cout << '\n';
    } else {
      cout << "NO" << '\n';
    }
  }
}
