#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k1, k;
  cin >> n >> k1;
  k = k1;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long count = 0;
  vector<long long> ans;
  for (long long i = 0; i < n; i++) {
    if (a[i] % 2 != 0) {
      count++;
    }
    if (count % 2 != 0 && k > 1) {
      count = 0;
      ans.push_back(i + 1);
      k--;
    }
  }
  if (count % 2 != 0) {
    ans.push_back(n);
  }
  if (ans.size() != k1) {
    cout << "NO" << '\n';
    return;
  }
  cout << "YES" << '\n';
  for (long long i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long TESTS = 1;
  cin >> TESTS;
  while (TESTS--) {
    solve();
  }
  return 0;
}
