#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 7;
const int MOD = (int)1e9 + 7;
const long long INF = (long long)1e18 + 7;
int a[2 * N];
int res[2 * N];
int main() {
  int t, n, k;
  cin >> t;
  while (t--) {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    int t = 0;
    int i = 1;
    for (; i <= n && t + 1 < k; i++)
      if (a[i] % 2 == 1) res[++t] = i;
    int s = 0;
    if (t + 1 < k)
      cout << "NO\n";
    else {
      for (; i <= n; i++) s = (s + a[i]) % 2;
      if (s == 0)
        cout << "NO\n";
      else {
        res[k] = n;
        cout << "YES\n";
        for (int j = 1; j <= k; j++) cout << res[j] << " ";
        cout << "\n";
      }
    }
  }
}
