#include <bits/stdc++.h>
using namespace std;
void TC() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<long long int> res;
  long long int seg = 0, idx = -1;
  for (long long int i = n - 1, j = n - 1; i >= 0; i = j) {
    if (seg >= k - 1) {
      idx = i;
      res.push_back(i);
      break;
    }
    long long int sum = 0;
    while (j >= 0 && (sum % 2 == 0)) {
      sum += a[j];
      j--;
    }
    seg++;
    if (j != -1) res.push_back(i);
  }
  long long int sum1 = 0;
  for (long long int i = 0; i <= idx; i++) {
    sum1 += a[i];
  }
  if (sum1 % 2 == 0 || res.size() != k) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    sort(res.begin(), res.end());
    for (long long int i : res) cout << i + 1 << " ";
    cout << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int T;
  cin >> T;
  for (long long int TEST = 1; TEST <= T; TEST++) {
    TC();
  }
  return 0;
}
