#include<bits/stdc++.h>
using namespace std;
#define ll long long 

bool ok = 0;
int t,n,k;
ll arr[50] , sum;



void solve(int step,int mask){

	if(step == k){
		ok = 1;
		return ;
	}
	int ans = -1;
	for(int i=((1<<n)-1) ; i > 0 ; i = ((i-1)&((1<<n)-1))){
		if((mask & i) == 0){
			int cnt = 0 , temp = i, bit = 1000;
			ll temps = 0;
			while( temp ){ if(temp&1){ temps+= arr[cnt];} cnt++ , temp/=2;}
			if(temps == sum/k && bit > __builtin_popcount(i))
				ans = i , bit = __builtin_popcount(i);
		}
	}
	if(ans!=-1)
		solve(step+1,mask|ans);	
		
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&k);
		sum = 0;
		for(int i=0;i<n;i++){
			scanf("%lld",&arr[i]);
			sum += arr[i];		
		ok = 0;
		}
		if(sum%k != 0 || k>n)
			ok = 0;
		else
			solve(0,0);
		puts(ok ? "yes" : "no");	
	}
	return 0;
}