#include <bits/stdc++.h>
int n, t, k;
int a[202020];
int solve() {
  int ans = 0;
  int odd = 0;
  for (int i = 0; i < (int)(n); i++)
    if (a[i] % 2) odd++;
  if ((odd % 2) != (k % 2) || odd < k)
    ans = 0;
  else
    ans = 1;
  return ans;
}
int main() {
  scanf("%d", &t);
  for (int tes = 0; tes < (int)(t); tes++) {
    scanf("%d", &n);
    scanf("%d", &k);
    for (int i = 0; i < (int)(n); i++) scanf("%d", a + i);
    if (solve()) {
      puts("YES");
      for (int j = 0; j < (int)(n); j++) {
        if (k <= 1) break;
        if (a[j] % 2) {
          printf("%d ", j + 1);
          k--;
        }
      }
      printf("%d\n", n);
    } else
      puts("NO");
  }
}
