Codeforces 1136C

C. Nastya Is Transposing Matrices

Nastya came to her informatics lesson, and her teacher who is, by the way, a little bit famous here gave her the following task.

Two matrices A and B are given, each of them has size n×m. Nastya can perform the following operation to matrix A unlimited number of times:

take any square square submatrix of A and transpose it (i.e. the element of the submatrix which was in the i-th row and j-th column of the submatrix will be in the j-th row and i-th column after transposing, and the transposed submatrix itself will keep its place in the matrix A).
Nastya’s task is to check whether it is possible to transform the matrix A to the matrix B.

Example of the operation

As it may require a lot of operations, you are asked to answer this question for Nastya.

A square submatrix of matrix M is a matrix which consist of all elements which comes from one of the rows with indeces x,x+1,…,x+k−1 of matrix M and comes from one of the columns with indeces y,y+1,…,y+k−1 of matrix M. k is the size of square submatrix. In other words, square submatrix is the set of elements of source matrix which form a solid square (i.e. without holes).

Input

The first line contains two integers n and m separated by space (1≤n,m≤500) — the numbers of rows and columns in A and B respectively.

Each of the next n lines contains m integers, the j-th number in the i-th of these lines denotes the j-th element of the i-th row of the matrix A (1≤Aij≤109).

Each of the next n lines contains m integers, the j-th number in the i-th of these lines denotes the j-th element of the i-th row of the matrix B (1≤Bij≤109).

Output

Print “YES” (without quotes) if it is possible to transform A to B and “NO” (without quotes) otherwise.

You can print each letter in any case (upper or lower).

Examples

input
2 2
1 1
6 1
1 6
1 1
output
YES

input
2 2
4 4
4 5
5 4
4 4
output
NO

input
3 3
1 2 3
4 5 6
7 8 9
1 4 7
2 5 6
3 8 9
output
YES

Note

Consider the third example. The matrix A initially looks as follows.
$$\left\{\begin{array}{ccc}1& 2& 3\\ 4& 5& 6\\ 7& 8& 9\end{array}\right\}$$
Then we choose the whole matrix as transposed submatrix and it becomes

$$\left\{\begin{array}{ccc}1& 4& 7\\ 2& 5& 8\\ 3& 6& 9\end{array}\right\}$$
Then we transpose the submatrix with corners in cells (2,2) and (3,3).
$$\left\{\begin{array}{ccc}1& 4& 7\\ 2& 5& 8\\ 3& 6& 9\end{array}\right\}$$
So matrix becomes
$$\left\{\begin{array}{ccc}1& 4& 7\\ 2& 5& 6\\ 3& 8& 9\end{array}\right\}$$
and it is B.

Solution

现在给出一个n×m的方阵，任意将其的子矩阵进行翻转，翻转实际上是从右上角往左下角翻转，左上角到右下角的一条对角线不变。画图发现，线上的元素可以随意交换，但是怎么换都在这条线上。所以只要每条对角线上拥有的元素相同，就符合题意。不加速的话，cin会炸。

Code

#include<cstdio>
using namespace std;
const int maxn = 1000+5;

int n,m,a[maxn][maxn],b[maxn][maxn];

int main() {
	while(scanf("%d%d",&n,&m) != EOF) {
		for(int i=0; i<n; i++) {
			for(int j=0; j<m; j++) {
				scanf("%d",&a[i][j]);
			}
		}
		for(int i=0; i<n; i++) {
			for(int j=0; j<m; j++) {
				scanf("%d",&b[i][j]);
			}
		}
		for(int i=0; i<n; i++) {
			for(int j=0; j<m; j++) {
				for(int k=0; k<=i+j; k++) {
					if(a[k][i+j-k] == b[i][j]) {
						a[k][i+j-k] = 0;
						break;
					}
				}
			}
		}
		bool flag = true;
		for(int i=0; i<n; i++) {
			for(int j=0; j<m; j++) {
				if(a[i][j] != 0) {
					flag = false;
					break;
				}
			}
		}
		if(flag) {
			printf("YES\n");
		} 
		else {
			printf("NO\n");
		}
	}
}

Source

Codeforces 1136C Nastya Is Transposing Matrices