#include <bits/stdc++.h>
using namespace std;
bool ispower(int x, set<int> s) {
  int f = 0;
  while (x % 2 == 0) {
    x = x / 2;
    f = 1;
  }
  if (f == 1 && x != 1) return false;
  if (x == 1) return true;
  int t = sqrt(x);
  for (int i = 3; i <= t; i += 2) {
    while (x % i == 0) {
      f = 1;
      x = x / i;
    }
    if (f == 1 && (x != 1)) return false;
    if (f == 1 && (x == 1 || s.find(i) == s.end())) return true;
  }
  return false;
}
bool isprime(int x) {
  for (int i = 2; i <= x / 2; i++)
    if (x % i == 0) return false;
  return true;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    int a[n];
    int o = 0, e = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 2)
        o++;
      else
        e++;
    }
    if (x % 2) {
      int f = 0;
      for (int i = x; i >= 0; i -= 2) {
        if (o >= i && e >= (x - i)) {
          f = 1;
          break;
        }
      }
      if (f == 1)
        cout << "Yes\n";
      else
        cout << "No\n";
    } else {
      int f = 0;
      for (int i = x - 1; i >= 0; i -= 2) {
        if (o >= i && e >= (x - i)) {
          f = 1;
          break;
        }
      }
      if (f == 1)
        cout << "Yes\n";
      else
        cout << "No\n";
    }
  }
  return 0;
}
