#include <bits/stdc++.h>
using namespace std;
const int Z = (int)3e3 + 228;
const int N = (int)3e5 + 228;
const int INF = (int)1e9 + 228;
const int MOD = (int)1e9 + 7;
int a[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int q;
  cin >> q;
  while (q--) {
    int n, k;
    cin >> n >> k;
    long long sum = 0;
    for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i];
    if (k == 1)
      if (sum % 2 == 0) {
        cout << "NO\n";
        continue;
      } else {
        cout << "YES\n" << n << "\n";
        continue;
      }
    long long cur = 0;
    vector<int> ans;
    for (int i = 1; i <= n; i++) {
      if (ans.size() == k) break;
      cur += a[i];
      if (cur % 2) {
        cur = 0;
        ans.push_back(i);
      }
    }
    if (ans.size() != k)
      cout << "NO\n";
    else {
      ans.pop_back();
      for (int i = ans.back() + 1; i <= n; i++) cur += a[i];
      if (cur % 2 == 0)
        cout << "NO\n";
      else {
        ans.push_back(n);
        cout << "YES\n";
        for (int i : ans) cout << i << ' ';
        cout << "\n";
      }
    }
  }
  return 0;
}
