#include <bits/stdc++.h>
using namespace std;
int test, n, k, pos[200005], x, p;
long long arr[200005], sum;
int main() {
  scanf("%d", &test);
  for (int t = 0; t < test; t++) {
    p = 0;
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; i++) {
      scanf("%I64d", &arr[i]);
      if (arr[i] % 2 != 0) pos[p++] = i;
    }
    if (p < k) {
      printf("NO");
    } else {
      x = p - k;
      if (x % 2 != 0 and p > k) {
        printf("NO");
      } else {
        printf("YES\n");
        if (pos[p - 1] != n - 1) pos[p - 1] = n - 1;
        for (int i = p - k; i < p; i++) {
          printf("%d ", pos[i] + 1);
        }
      }
    }
    printf("\n");
  }
  return 0;
}
