func_code_string: #include <bits/stdc++.h>   using namespace std;   void err(istream_iterator<string> it) {}   template <typename T, typename... Args>   void err(istream_iterator<string> it, T a, Args... args) {     cerr << *it <<   =   << a <<   n ;     err(++it, args...);   }   long long powMod(long long x, long long y) {     long long p = 1;     while (y) {       if (y % 2) {         p = (p * x) % ((long long)1e9 + 7);       }       y /= 2;       x = (x * x) % ((long long)1e9 + 7);     }     return p;   }   long long CpowMod(long long x, long long y, long long w) {     long long p = 1;     while (y) {       if (y % 2) {         p = (p * x) % w;       }       y /= 2;       x = (x * x) % w;     }     return p;   }   long long invMod(long long x) { return powMod(x, ((long long)1e9 + 7) - 2); }   long long CinvMod(long long x, long long w) { return CpowMod(x, w - 2, w); }   long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }   long long exGcd(long long a, long long b, long long &x, long long &y) {     if (b == 0) {       y = 0;       x = 1;       return a;     }     long long xtmp, ytmp;     long long g = exGcd(b, a % b, xtmp, ytmp);     x = ytmp;     y = xtmp - (a / b) * ytmp;     return g;   }   void solve() {     long long t;     cin >> t;     while (t--) {       long long n;       long long x;       cin >> n >> x;       long long cnt = 0, eve = 0;       for (long long i = 0; i <= n - 1; i++) {         long long y;         cin >> y;         if (y % 2)           cnt++;         else           eve++;       }       if (cnt == 0) {         cout <<  NO  <<   n ;         continue;       }       long long mn;       if (x % 2 == 1) {         mn = 0;       } else         mn = 1;       if (cnt % 2 == 0) {         x -= (cnt - 1);       } else         x -= cnt;       x = max(mn, x);       if (eve >= x) {         cout <<  YES  <<   n ;       } else         cout <<  NO  <<   n ;     }   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     solve();     return 0;   }   