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