#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n, x;
long long a[N], f[2];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t;
  cin >> t;
  while (t--) {
    f[0] = f[1] = 0;
    cin >> n >> x;
    for (long long i = 1; i <= n; i++) {
      cin >> a[i];
      f[a[i] % 2]++;
    }
    bool flag = 0;
    long long need;
    for (long long i = 1; i <= f[1] && i <= x; i += 2) {
      need = x - i;
      if (need <= f[0]) {
        flag = 1;
        break;
      }
    }
    if (flag)
      cout << "Yes"
           << "\n";
    else
      cout << "No"
           << "\n";
  }
  return 0;
}
