#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const int mod = 998244353;
const int maxn = 5e5 + 100;
const int maxm = 2e6 + 100;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
int n;
int a[maxn];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int x;
    scanf("%d %d", &n, &x);
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      if (a[i] & 1) cnt++;
    }
    int now = min(cnt, x);
    int res = x - now;
    if (now % 2 == 0) {
      now--;
      res++;
    }
    int ok = 1;
    if (!(now >= 0 && now <= x)) ok = 0;
    if (!(res >= 0 && res <= x)) ok = 0;
    if (!(res <= n - cnt)) ok = 0;
    if (ok)
      printf("Yes\n");
    else
      printf("No\n");
  }
  return 0;
}
