/*
	author: praveen dhinwa
	verdict: AC
*/
#include <bits/stdc++.h>

using namespace std;

int a[55];

int main() {
	int T;
	cin >> T;
	while (T--) {
		int n, k;
		cin >> n >> k;
		int cntEven = 0;
		for (int i = 0; i < n; i++) {
			cin >> a[i];
			if (a[i] % 2 == 0) {
				cntEven ++;
			}			
		}
		int ok = false;
		for (int i = 0; i < n; i++) {
			for (int j = i; j < n; j++) {
				int cnt = 0;
				for (int k1 = i; k1 <= j; k1++) {
					if (a[k1] % 2 == 0) {
						cnt ++;
					}
				}
				if (cnt == k) {
					ok = true;
				}
			}
		}
		if (ok) {
			cout << "YES" << endl;
		} else {
			cout << "NO" << endl;
		}
	}
	return 0;
}