#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 10;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const int bit = 32;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, m;
    scanf("%d%d", &n, &m);
    int s1 = 0, s2 = 0;
    for (int i = 1; i <= n; i++) {
      int x;
      scanf("%d", &x);
      if (x & 1)
        s1++;
      else
        s2++;
    }
    if (s1 == 0 || (s2 == 0 && m % 2 == 0)) {
      puts("No");
      continue;
    }
    if (s1 & 1)
      s2 += (s1 - 1);
    else
      s2 += (s1 - 2);
    if (s2 >= m - 1 && s1) {
      puts("Yes");
    } else
      puts("No");
  }
  return 0;
}
