#include <bits/stdc++.h>
using namespace std;
int t,id,n,ans;
int a[1000005];
bool f;
bool ff(int l,int r,int s) {
	while(l<=r) {
		int mid=(l+r)/2;
		if(a[mid]<s)
			l=mid+1;
		else
			r=mid-1;
	}
	if(a[l]==s)
		return true;
	else
		return false;
}
int main() {
	cin>>t>>id;
	while(t--) {
  		f = false;
		cin>>n;
		for(int i = 1; i <= n; i++)
			cin>>a[i];
		sort(a + 1,a + n + 1);
		ans = a[1] + a[n];
		for(int i = 2; i < n; i++) {
			bool vis = ff(i + 1,n,ans - a[i]);
			if(vis) {
				cout<<"Yes\n";
				f = true;
				break;
			}
		}
		if(!f)
			cout<<"No\n";
	}
	return 0;
}