#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
void pr(long long x) { cout << x; }
void prl(long long x) { cout << x << "\n"; }
const long long N = (long long)(1 * 1e6 + 10);
using namespace std;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n, x, co = 0, ce = 0, sum = 0;
    cin >> n >> x;
    long long a[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 2 == 0)
        ce++;
      else
        co++;
      sum += a[i];
    }
    if (x == n) {
      if (sum % 2 == 0)
        cout << "No"
             << "\n";
      else
        cout << "Yes"
             << "\n";
    } else if (ce == n)
      cout << "No"
           << "\n";
    else if (co == n) {
      if (x % 2 == 0)
        cout << "No"
             << "\n";
      else
        cout << "Yes"
             << "\n";
    } else if (ce >= x - 1 && co >= 1) {
      cout << "Yes"
           << "\n";
    } else if (ce < x - 1) {
      if (x % 2 != 0 && co >= x || x % 2 != 0 && co < x) {
        cout << "Yes"
             << "\n";
      }
      if (x % 2 == 0 && co >= x || x % 2 == 0 && co < x) {
        if (ce >= 1)
          cout << "Yes"
               << "\n";
        else
          cout << "No"
               << "\n";
      }
    }
  }
}
