#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <assert.h>
using namespace std;
 
 
 
long long readInt(long long l,long long r,char endd){
	long long x=0;
	int cnt=0;
	int fi=-1;
	bool is_neg=false;
	while(true){
		char g=getchar();
		if(g=='-'){
			assert(fi==-1);
			is_neg=true;
			continue;
		}
		if('0'<=g && g<='9'){
			x*=10;
			x+=g-'0';
			if(cnt==0){
				fi=g-'0';
			}
			cnt++;
			assert(fi!=0 || cnt==1);
			assert(fi!=0 || is_neg==false);
			
			assert(!(cnt>19 || ( cnt==19 && fi>1) ));
		} else if(g==endd){
			assert(cnt>0);
			if(is_neg){
				x= -x;
			}
			if(!(l<=x && x<=r)){
				cerr<<l <<" "<<r<<" "<<x<<endl;
			}
			assert(l<=x && x<=r);
			return x;
		} else {
			assert(false);
		}
	}
}
string readString(int l,int r,char endd){
	string ret="";
	int cnt=0;
	while(true){
		char g=getchar();
		assert(g!=-1);
		if(g==endd){
			break;
		}
		cnt++;
		ret+=g;
	}
	assert(l<=cnt && cnt<=r);
	return ret;
}
long long readIntSp(long long l,long long r){
	return readInt(l,r,' ');
}
long long readIntLn(long long l,long long r){
	return readInt(l,r,'\n');
}
string readStringLn(int l,int r){
	return readString(l,r,'\n');
}
string readStringSp(int l,int r){
	return readString(l,r,' ');
}

int T;
int n,m;
int C[1010][1010];
int sm_nm=0;
int L[1010],R[1010],P[1010],Q[1010];

int val_a[1010];
int val_b[1010];
bool ok=true;

vector<pair<int ,int> > comp;

void dfs(int ind,int ty,int xr){
	if(!ok)return;
	comp.push_back(make_pair(ind,ty));
	if(ty == 1){
		
		val_a[ind] = xr;
		for(int j=0;j<m;j++){
			if(C[ind][j]==-1)continue;
			if(val_b[j] == -1){
				dfs(j,2,xr ^ C[ind][j]);
			} else {
				if(val_b[j] != (xr ^ C[ind][j])){
					ok=false;
					return;
				}
			}
		}
	} else {
		val_b[ind] = xr;
		for(int j=0;j<n;j++){
			if(C[j][ind]==-1)continue;
			if(val_a[j] == -1){
				dfs(j,1,xr ^ C[j][ind]);
			} else {
				if(val_a[j] != (xr ^ C[j][ind])){
					ok=false;
					return;
				}
			}
		}
	}
}

int solve(int lvl,int xr,vector<pair<int ,int>> arr){
	if(lvl == -1)return xr;
	int k=arr.size();

	bool is_zero=true,is_one=true;
	vector<pair<int,int> > tm;
	for(int i=0;i<k;i++){
		if(arr[i].second == 1){
			int mx_possible=(((val_a[arr[i].first] ^ xr) >> lvl) << lvl ) + (1<<lvl)-1;
			int mn_possible=(((val_a[arr[i].first] ^ xr) >> lvl) << lvl );
			if( mn_possible > R[arr[i].first]){
				is_zero=false;
			}
			if(mx_possible < L[arr[i].first]){
				is_zero=false;
			}
			if(! (L[arr[i].first]<= mn_possible && mx_possible <=R[arr[i].first])){
				tm.push_back(arr[i]);
			}
		} else {
			int mx_possible=(((val_b[arr[i].first] ^ xr) >> lvl) << lvl ) + (1<<lvl)-1;
			int mn_possible=(((val_b[arr[i].first] ^ xr) >> lvl) << lvl );
			if( mn_possible > Q[arr[i].first]){
				is_zero=false;
			}
			if(mx_possible < P[arr[i].first]){
				is_zero=false;
			}
			if(! (P[arr[i].first]<= mn_possible && mx_possible <=Q[arr[i].first])){
				tm.push_back(arr[i]);
			}
		}
	}
	if(is_zero){
		int h= solve(lvl-1,xr,tm);
		if(h != -1)return h;
	}
	xr |= 1<<lvl;
	tm.clear();
	for(int i=0;i<k;i++){
		if(arr[i].second == 1){
			int mx_possible=(((val_a[arr[i].first] ^ xr) >> lvl) << lvl ) + (1<<lvl)-1;
			int mn_possible=(((val_a[arr[i].first] ^ xr) >> lvl) << lvl );
			if( mn_possible > R[arr[i].first]){
				is_one=false;
			}
			if(mx_possible < L[arr[i].first]){
				is_one=false;
			}
			if(! (L[arr[i].first]<= mn_possible && mx_possible <=R[arr[i].first])){
				tm.push_back(arr[i]);
			}
		} else {
			int mx_possible=(((val_b[arr[i].first] ^ xr) >> lvl) << lvl ) + (1<<lvl)-1;
			int mn_possible=(((val_b[arr[i].first] ^ xr) >> lvl) << lvl );
			if( mn_possible > Q[arr[i].first]){
				is_one=false;
			}
			if(mx_possible < P[arr[i].first]){
				is_one=false;
			}
			if(! (P[arr[i].first]<= mn_possible && mx_possible <=Q[arr[i].first])){
				tm.push_back(arr[i]);
			}
		}
	}
	if(is_one){
		int h= solve(lvl-1,xr,tm);
	
		if(h != -1)return h;
	}
	return -1;
}
int main(){
	//freopen("06.txt","r",stdin);
	//freopen("06o.txt","w",stdout);
	T=readIntLn(1,100);
	while(T--){
		n=readIntSp(1,1000);
		m=readIntLn(1,1000);
		sm_nm+=n*m;
		ok=true;
		for(int i=0;i<n;i++){
			val_a[i]=-1;
			L[i]=readIntSp(0,(1<<30)-1);
			R[i]=readIntLn(L[i],(1<<30)-1);
		}

		for(int i=0;i<m;i++){
			val_b[i]=-1;
			P[i]=readIntSp(0,(1<<30)-1);
			Q[i]=readIntLn(P[i],(1<<30)-1);
		}

		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				if(j == m-1){
					C[i][j] = readIntLn(-1,(1<<30)-1);
				} else {
					C[i][j] = readIntSp(-1,(1<<30)-1);
				}
				
			}
		}
		for(int i=0;i<n;i++){
			if(val_a[i] ==-1){
				comp.clear();
				dfs(i,1,0);
				if(!ok){
					break;
				}
				int h= solve(30,0,comp);
				if(h == -1){
					ok=false;
					break;
				}
				for(int i=0;i<comp.size();i++){
					if(comp[i].second == 1){
						val_a[comp[i].first] ^= h;
					} else {
						val_b[comp[i].first] ^= h;
					}
				}
			}
		}
		if(!ok){
			cout<<"NO"<<endl;
			continue;
		}
		for(int i=0;i<m;i++){
			if(val_b[i] ==-1){
				comp.clear();
				dfs(i,2,0);
				if(!ok){
					break;
				}
				int h= solve(30,0,comp);
				if(h == -1){
					ok=false;
					break;
				}
				for(int i=0;i<comp.size();i++){
					if(comp[i].second == 1){
						val_a[comp[i].first] ^= h;
					} else {
						val_b[comp[i].first] ^= h;
					}
				}
			}
		}
		if(!ok){
			cout<<"NO"<<endl;
			continue;
		}
		cout<<"YES"<<endl;
		for(int i=0;i<n;i++){
			cout<<val_a[i]<<" ";
		}
		cout<<endl;
		for(int i=0;i<m;i++){
			cout<<val_b[i]<<" ";
		}
		cout<<endl;
	}
	assert(getchar()==-1);
}