1980E - Permutation of Rows and Columns - CodeForces Solution

import sys
import heapq
from math import ceil, inf, gcd
from collections import defaultdict , Counter, deque
from bisect import bisect_left , bisect_right
import sys, threading
import random

mod = pow(10, 9) + 7

def ip():
  return int(input())

def input():
  return sys.stdin.readline().strip()

def readList():
  return list(map(int,input().split()))

def solve():
    n , m = readList()
    a = []
    b = []
    
    for _ in range(n):
        a.append(readList())
    
    for _ in range(n):
        b.append(readList())
    
    rows = defaultdict(int)
    columns = defaultdict(int)
    
    for i in range(n):
        for j in range(m):
            rows[b[i][j]] = i
            columns[b[i][j]] = j
    
    for i in range(n):
        val1 = rows[a[i][0]]
        for j in range(m):
            if rows[a[i][j]] != val1:
                print("NO")
                return
        
    
    for i in range(m):
        val1 = columns[a[0][i]]
        for j in range(n):
            if columns[a[j][i]] != val1:
                print("NO")
                return
    
    print("YES")
            
    
T = int(input())
for _ in range(T):
    solve()