#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = INF * (long long)INF;
const int MOD = 1000 * 1000 * 1000 + 7;
const int MAX = 1000 * 1000 + 47;
const int LEN = 25;
pair<pair<int, int>, int> A[MAX];
int main() {
  int T;
  scanf("%d", &T);
  for (int tt = (0); tt < (T); tt++) {
    int n;
    scanf("%d", &n);
    int m = n * 2 - 1;
    for (int i = (0); i < (m); i++) {
      int x, y;
      scanf("%d%d", &A[i].first.first, &A[i].first.second);
      A[i].second = i;
    }
    sort(A, A + m);
    reverse(A, A + m);
    long long a = 0, b = 0;
    for (int i = (1); i < (m); i++) {
      if (i & 1)
        a += A[i].first.second;
      else
        b += A[i].first.second;
    }
    printf("YES\n%d", A[0].second + 1);
    for (int i = (1); i < (m); i++)
      if ((i & 1) == (a > b)) printf(" %d", A[i].second + 1);
    printf("\n");
  }
  return 0;
}
