#include <bits/stdc++.h>
using namespace std;
 
int main() {
	// your code goes here
	int t;
	cin >> t;
	while(t--)
	{
		int n,k,c=0,d=0;
		cin >> n >> k;
		string s;
		cin >> s;
		for(int i=0;i<n;i++)
		{
			if(s[i]=='0') c++;
			else d++;
		}
		int p = (abs(c-d))/2;
		if((p<k) || k>(n/2)) cout << "NO" << endl;
		else if((k-p)%2==0) cout << "YES" << endl; /* here k is even and p is even
															so, k-p is always be 
															even;
															and k is odd and p is odd
															then k-p always be even;
															also we can say that 
															(k%2==0) and (p%2==0) then
															cout << YEs << endl;
															and (k%2==1) and (p%2==1)
															then cout yes ;
															or cout no for all of two;;*/
		else cout << "NO" << endl;
 
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCB0OwoJY2luID4+IHQ7Cgl3aGlsZSh0LS0pCgl7CgkJaW50IG4sayxjPTAsZD0wOwoJCWNpbiA+PiBuID4+IGs7CgkJc3RyaW5nIHM7CgkJY2luID4+IHM7CgkJZm9yKGludCBpPTA7aTxuO2krKykKCQl7CgkJCWlmKHNbaV09PScwJykgYysrOwoJCQllbHNlIGQrKzsKCQl9CgkJaW50IHAgPSAoYWJzKGMtZCkpLzI7CgkJaWYoKHA8aykgfHwgaz4obi8yKSkgY291dCA8PCAiTk8iIDw8IGVuZGw7CgkJZWxzZSBpZigoay1wKSUyPT0wKSBjb3V0IDw8ICJZRVMiIDw8IGVuZGw7IC8qIGhlcmUgayBpcyBldmVuIGFuZCBwIGlzIGV2ZW4KCQkJCQkJCQkJCQkJCQkJc28sIGstcCBpcyBhbHdheXMgYmUgCgkJCQkJCQkJCQkJCQkJCWV2ZW47CgkJCQkJCQkJCQkJCQkJCWFuZCBrIGlzIG9kZCBhbmQgcCBpcyBvZGQKCQkJCQkJCQkJCQkJCQkJdGhlbiBrLXAgYWx3YXlzIGJlIGV2ZW47CgkJCQkJCQkJCQkJCQkJCWFsc28gd2UgY2FuIHNheSB0aGF0IAoJCQkJCQkJCQkJCQkJCQkoayUyPT0wKSBhbmQgKHAlMj09MCkgdGhlbgoJCQkJCQkJCQkJCQkJCQljb3V0IDw8IFlFcyA8PCBlbmRsOwoJCQkJCQkJCQkJCQkJCQlhbmQgKGslMj09MSkgYW5kIChwJTI9PTEpCgkJCQkJCQkJCQkJCQkJCXRoZW4gY291dCB5ZXMgOwoJCQkJCQkJCQkJCQkJCQlvciBjb3V0IG5vIGZvciBhbGwgb2YgdHdvOzsqLwoJCWVsc2UgY291dCA8PCAiTk8iIDw8IGVuZGw7CgkJCQkJCQkJCQkJCQkJCQoJfQoJcmV0dXJuIDA7Cn0=

Ngo2IDIKMDAwMDAwCjIgMQowMQo0IDEKMTAxMQoxMCAyCjExMDEwMTEwMDEKMTAgMQoxMTAxMDExMDAxCjIgMQoxMQo=

6
6 2
000000
2 1
01
4 1
1011
10 2
1101011001
10 1
1101011001
2 1
11