#include <bits/stdc++.h>
using namespace std;
const int maxn = 200004;
struct note {
  int x, y, ip;
} a[maxn];
bool cmp(note a, note b) {
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
int n, ans[maxn];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    for (int i = 1; i <= 2 * n - 1; i++) {
      scanf("%d%d", &a[i].x, &a[i].y);
      a[i].ip = i;
    }
    sort(a + 1, a + n * 2, cmp);
    int k = 0;
    for (int i = 1; i < 2 * n - 1; i += 2) {
      if (a[i].y >= a[i + 1].y)
        ans[k++] = a[i].ip;
      else
        ans[k++] = a[i + 1].ip;
    }
    ans[k++] = a[2 * n - 1].ip;
    puts("YES");
    sort(ans, ans + k);
    for (int i = 0; i < k; i++) printf(i == k - 1 ? "%d\n" : "%d ", ans[i]);
  }
  return 0;
}
