#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int k;
  cin >> k;
  bool flag = false;
  unordered_map<int, int> mp;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    mp[a % 2]++;
  }
  int a = mp[1];
  int b = mp[0];
  for (int i = 1; i <= a && i <= k; i += 2) {
    if (k - i <= b) {
      flag = 1;
    }
  }
  if (flag) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
