#include <bits/stdc++.h>
using namespace std;
const int MA = 2e5 + 5;
long long a[MA];
int num[MA];
int main() {
  int T;
  int n, k;
  scanf("%d", &T);
  while (T--) {
    int t = 0;
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; ++i) {
      scanf("%lld", &a[i]);
    }
    long long sum = 0;
    for (int i = 1; i <= n; ++i) {
      sum += a[i];
      if (sum % 2 == 1) {
        num[t++] = i;
        sum = 0;
      }
    }
    if (sum) {
      num[--t] = n;
      t++;
    }
    if ((t - k + 1) % 2 == 1) {
      printf("YES\n");
      for (int i = t - k; i < t; ++i) {
        printf("%d ", num[i]);
      }
      printf("\n");
    } else
      printf("NO\n");
  }
  return 0;
}
