VCake

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,ll*A){F(N)scanf("%lld",A+i);}
ll N,M,A[3];
bool aa(ll N,ll M){
    if(!N||!M||A[1]%N)return 0;
    ll h(A[1]/N),m(M-h);
    return m*N==A[2];
}
bool rm(ll M){
    return aa(N,M)||aa(M,N);
}
bool gd(){
    if(*A%N)return 0;
    ll h(*A/N),m(M-h);
    if(m<=0)return 0;
    return rm(m);
}
bool ok(){
    sort(A,A+3);
    do{
        if(gd()) return 1;
    }while(next_permutation(A,A+3));
    return 0;
}
int main(void){
    IN(tt)F(tt){
        scanf("%lld%lld",&N,&M),ga(3,A);
        if(ok())puts("Yes");
        else {
            swap(N,M);
            if(ok())puts("Yes");
            else puts("No");
        }
    }
    return 0;
}