#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int v[250005],gen[250005];
int t,n,a,b;
int main()
{
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        cin>>n>>c>>d;
        int num=0;
        for(int j=1;j<=n*n;j++)
        {
            cin>>v[j];
        }
        sort(v+1,v+n*n+1);
        gen[1]=v[1];
        for(int j=2;j<=n;j++)
        {
            gen[j]=gen[j-1]+c;
        }
        for(int j=2;j<=n;j++)
        {
            for(int k=1;k<=n;k++)
            {
                gen[k+j*n-1]=gen[(j-1)*n+k-1]+d;
            }
        }
        sort (gen+1,gen+n*n+1);
        bool ok=1;
        for(int i=1;i<=n*n;i++)
        {
            if(gen[i]!=v[i])
            {
                ok=0;
                break;
            }
        }
        if(ok==1)
        {
            cout<<"yes"<<"\n";
        }
        else
        {
            cout<<"no"<<"\n";
        }
        
    }
}