#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<int, int>, int> > v;
int main(void) {
  int t;
  scanf("%d", &t);
  while (t--) {
    v.clear();
    int n;
    scanf("%d", &n);
    long long sumA = 0;
    long long sumB = 0;
    for (int i = 0; i < 2 * n - 1; i++) {
      int x, y;
      scanf("%d%d", &x, &y);
      sumA += (long long)x;
      sumB += (long long)y;
      v.push_back(make_pair(make_pair(x, y), i));
    }
    sort(v.begin(), v.end());
    long long sumAt = 0;
    long long sumBt = 0;
    for (int i = 0; i < 2 * n - 1; i += 2) {
      sumBt += (long long)v[i].first.second;
    }
    vector<int> ans;
    if (((2ll * sumBt) >= sumB)) {
      for (int i = 0; i < 2 * n - 1; i += 2) ans.push_back(v[i].second);
    } else {
      for (int i = 1; i < 2 * n - 1; i += 2) ans.push_back(v[i].second);
      ans.push_back(v[2 * (n - 2)].second);
    }
    sort(ans.begin(), ans.end());
    printf("YES\n");
    for (int i = 0; i < ans.size(); i++)
      printf("%d%c", ans[i] + 1, i == (ans.size() - 1) ? '\n' : ' ');
  }
  return 0;
}
