#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, m, k, cas;
int a[maxn];
signed main() {
  cin >> cas;
  while (cas--) {
    cin >> n >> k;
    int odd = 0;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      if (a[i] & 1) odd++;
    }
    if (odd < k || (k % 2 != odd % 2)) {
      cout << "NO" << endl;
    } else {
      int pos = 0;
      cout << "YES" << endl;
      for (int i = 1; i < n; i++) {
        if (a[i] & 1) {
          if (pos == k - 1)
            break;
          else
            cout << i << " ";
          pos++;
        }
      }
      cout << n << endl;
    }
  }
  return 0;
}
