#include <bits/stdc++.h>
using namespace std;
vector<int> va, vo, vi;
bool cmp(int i, int j) { return va[i] < va[j]; }
int main() {
  int cases, n, a, o, len;
  cin >> cases;
  while (cases-- != 0) {
    cin >> n;
    len = 2 * n - 1;
    va.clear();
    vo.clear();
    vi.clear();
    for (int i = 0; i < len; ++i) {
      cin >> a >> o;
      va.push_back(a);
      vo.push_back(o);
      vi.push_back(i);
    }
    ::sort(vi.begin(), vi.end(), cmp);
    cout << "YES" << endl;
    for (int i = 0; i < len - 1; i += 2) {
      if (vo[vi[i]] > vo[vi[i + 1]])
        cout << (vi[i] + 1) << " ";
      else
        cout << (vi[i + 1] + 1) << " ";
    }
    cout << (vi[len - 1] + 1) << endl;
  }
  return 0;
}
