#include<bits/stdc++.h>
#define int long long
#define re register int
#define cin(x) scanf("%lld",&x)
using namespace std;
const int N=3e3+5,mod=998244353;
int a[N][N],b[N][N],c,d,n,t;
void solve(){
	cin(n);
	for(re i=1;i<=n;i++)
	for(re j=1;j<=n;j++)cin(a[i][j]);
	for(re i=1;i<=n;i++)
	for(re j=1;j<=n;j++)cin(b[i][j]);
	for(re i=1;i<=n;i++){
		for(re j=1;j<=n;j++){
			cin(c);
			for(re k=1;k<=n;k++)
				d=(d+(a[i][k]*b[k][j]%mod))%mod;
			if(c!=d){
				puts("No");
				return;
			}
		}
	}
	puts("Yes");
}
signed main(){
	cin(t);
	while(t--){
		solve();
	}
	return 0;
}