#include <bits/stdc++.h>
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans % m;
}
using namespace std;
void sol() {
  int n, first;
  cin >> n >> first;
  int ce = 0, co = 0;
  for (int(i) = (0); (i) < (n); (i)++) {
    int a;
    cin >> a;
    if (a % 2 == 0)
      ce++;
    else
      co++;
  }
  for (int i = 1; i <= first; i += 2) {
    if (co >= i && ce >= first - i) {
      cout << "Yes" << '\n';
      return;
    }
  }
  cout << "No" << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) sol();
  return 0;
}
