#include using namespace std; #define ALL(x) (x).begin(), (x).end() #define REP(i, n) for(ll i=0; i<(ll)(n); i++) template bool chmax(T& a, T b) { return a bool chmin(T& a, T b) { return a>b ? a=b, true : false; } using ll=long long; const int INF=1e9+10; const ll INFL=4e18; using VI=vector; using VVI=vector; using VL=vector; using VVL=vector; using PL=pair; using VP=vector; using WG=vector>>; #ifdef LOCAL #include "./debug.hpp" #else #define debug(...) #define print_line #endif template vector> MatMul(const vector>& A, const vector>& B) { int N=A.size(); vector> ret(N,vector(N)); for(int i=0; i vector> MatPow(vector> A, ll b) { int N=A.size(); vector> ret(N,vector(N)); for(int i=0; i>=1; } return ret; } //---------------------------------------------------------- void solve() { ll N=2; VVL A(N,VL(N)),B=A; REP(i,N) REP(j,N) cin>>A[i][j]; REP(i,N) REP(j,N) cin>>B[i][j]; ll P=67; REP(a,P) REP(b,a+1) REP(c,P) REP(d,c+1) { if(abs(a*d-b*c)%P==0) continue; VVL C={{a,b},{c,d}}; auto le=MatMul(C,A), ri=MatMul(B,C); bool ok=true; REP(i,N) REP(j,N) if(abs(le[i][j]-ri[i][j])%P!=0) ok=false; if(ok) { puts("Yes"); return; } } puts("No"); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout<>T; while(T--) solve(); }