#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000000 + 5];
void work()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    sort(a + 1, a + n + 1);
    bool flag = false;
    for (int i = 2; i <= n - 1; i++)
    {
        // a[i] - a[1] == a[n] - a[j]
        // 找是否存在这样的 a[j]
        // a[j] = a[n]+a[1]-a[i]
        if (binary_search(a + (i + 1), a + (n - 1) + 1, a[1] + a[n] - a[i]))
        {
            flag = true;
            break;
        }
    }
    if (flag)
        cout << "Yes\n";
    else
        cout << "No\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T, id;
    cin >> T >> id;
    while (T--)
        work();
    return 0;
}