#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long power(long long a, long long n) {
  long long res = 1;
  while (n != 0) {
    if (n % 2) {
      res = res * a;
      n--;
    } else {
      a = a * a;
      n = n / 2;
    }
  }
  return res;
}
void solve() {
  int n, x;
  cin >> n >> x;
  vector<int> v(n, 0);
  int ce = 0, co = 0;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    if (v[i] % 2 == 0)
      ce++;
    else
      co++;
  }
  for (int i = 1; i <= x; i = i + 2) {
    if (i <= co && x - i <= ce) {
      cout << "Yes" << '\n';
      return;
    }
  }
  cout << "No" << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) solve();
}
