#include <bits/stdc++.h>
using namespace std;
long long bs(long long a[], long long l, long long h, long long key) {
  long long res = -1;
  while (l <= h) {
    long long mid = (l + h) / 2;
    if (a[mid] == key) {
      return mid;
    } else if (a[mid] > key) {
      res = mid;
      l = mid + 1;
    } else {
      h = mid - 1;
    }
  }
  return res;
}
int32_t main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n, x, a;
    cin >> n >> x;
    vector<long long> v1, v2;
    for (long long i = 0; i < n; i++) {
      cin >> a;
      if (a % 2 == 0)
        v1.push_back(a);
      else
        v2.push_back(a);
    }
    if (v2.size() == 0)
      cout << "NO" << endl;
    else if (n < x)
      cout << "NO" << endl;
    else if (x % 2 != 0) {
      if (v2.size() % 2 == 0) {
        if (v2.size() - 2 + v1.size() >= x - 1)
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      } else {
        if (v2.size() - 1 + v1.size() >= x - 1)
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      }
    } else {
      if (v1.size() == 0)
        cout << "NO" << endl;
      else if (v2.size() % 2 == 0) {
        if (v2.size() - 2 + v1.size() >= x - 1)
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      } else {
        if (v2.size() - 1 + v1.size() >= x - 1)
          cout << "YES" << endl;
        else
          cout << "NO" << endl;
      }
    }
  }
}
