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

typedef long long ll;
#define bug(x) cout<<#x<<" : "<<x<<endl;
#define bug2(a,b) cout<<#a<<" : "<<a<<"\t"<<#b<<" : "<<b<<endl;

int n;
string a,b;
const int N=1e5+7,M=200;
int dp[N][M];
vector<int>aa,bb;

int f(int i,char last){
	if(i==n){
		return 1;
	}
	if(dp[i][(last)]!=-1)return dp[i][(last)];
	int ans=0;
	if((last)<=(b[i]))ans=max(ans,f(i+1,(b[i]-'a')));
	if((last-'a')<=(a[i]-'a'))ans=max(ans,f(i+1,(a[i]-'a')));
	// bug(last)
	// bug(ans)
	return dp[i][(last-'a')]=ans;
}
signed main(){
	
	ll t=1;cin>>t;
	while(t--){
		int n,m;cin>>n>>m;
        int x,y,p,q;cin>>x>>y>>p>>q;
        int l=abs(x-p);
        int r=abs(y-q);
        if((l+r)%2==0)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
	}
	return 0;
}