#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
long long sumA, sumO;
long long d[3 * N][2];
int n, ans[N];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    int K = 2 * n - 1;
    sumA = sumO = 0;
    for (int i = 0; i < K; ++i) {
      int a, o;
      scanf("%d%d", &a, &o);
      d[i][0] = a;
      d[i][1] = o;
      sumA += a;
      sumO += o;
    }
    for (int i = 0; i < n - 1; ++i) {
      d[i + K][0] = d[i][0];
      d[i + K][1] = d[i][1];
    }
    K += n - 1;
    long long ha, ho, ta, to;
    ha = (sumA + 1) >> 1;
    ho = (sumO + 1) >> 1;
    ta = to = 0;
    for (int i = 0; i < n; ++i) {
      ta += d[i][0];
      to += d[i][1];
    }
    for (int i = 0; i + n - 1 < K; ++i) {
      if (i) {
        ta = ta + d[i + n - 1][0] - d[i - 1][0];
        to = to + d[i + n - 1][1] - d[i - 1][1];
      }
      if (ta >= ha && to >= ho) {
        for (int j = 0; j < n; ++j) {
          ans[j] = (i + j) % (2 * n - 1);
        }
        break;
      }
    }
    sort(ans, ans + n);
    puts("YES");
    for (int i = 0; i < n; ++i) {
      if (i) putchar(' ');
      printf("%d", ans[i] + 1);
    }
    putchar('\n');
  }
  return 0;
}
