codeforcesC. Nastya Is Transposing Matrices

astya 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 AA and BB are given, each of them has size n×mn×m . Nastya can perform the following operation to matrix AA unlimited number of times:

• take any square square submatrix of AA and transpose it (i.e. the element of the submatrix which was in the ii -th row and jj -th column of the submatrix will be in the jj -th row and ii -th column after transposing, and the transposed submatrix itself will keep its place in the matrix AA ).

Nastya's task is to check whether it is possible to transform the matrix AA to the matrix BB .

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 MM is a matrix which consist of all elements which comes from one of the rows with indeces x,x+1,…,x+k−1x,x+1,…,x+k−1 of matrix MM and comes from one of the columns with indeces y,y+1,…,y+k−1y,y+1,…,y+k−1 of matrix MM . kk 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 nn and mm separated by space (1≤n,m≤5001≤n,m≤500 ) — the numbers of rows and columns in AA and BB respectively.

Each of the next nn lines contains mm integers, the jj -th number in the ii -th of these lines denotes the jj -th element of the ii -th row of the matrix AA (1≤Aij≤1091≤Aij≤109 ).

Each of the next nn lines contains mm integers, the jj -th number in the ii -th of these lines denotes the jj -th element of the ii -th row of the matrix BB (1≤Bij≤1091≤Bij≤109 ).

Output

Print "YES" (without quotes) if it is possible to transform AA to BB and "NO" (without quotes) otherwise.

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

Examples

Input

Copy

2 2
1 1
6 1
1 6
1 1

Output

Copy

YES

Input

Copy

2 2
4 4
4 5
5 4
4 4

Output

Copy

NO

Input

Copy

3 3
1 2 3
4 5 6
7 8 9
1 4 7
2 5 6
3 8 9

Output

Copy

YES

Note

Consider the third example. The matrix AA initially looks as follows.

 

⎡⎣⎢147258369⎤⎦⎥[123456789]

 

Then we choose the whole matrix as transposed submatrix and it becomes

 

⎡⎣⎢123456789⎤⎦⎥[147258369]

 

Then we transpose the submatrix with corners in cells (2,2)(2,2) and (3,3)(3,3) .

 

⎡⎣⎢123456789⎤⎦⎥[147258369]

 

So matrix becomes

 

⎡⎣⎢123458769⎤⎦⎥[147256389]

 

and it is BB .

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int a[1001][1001],book[1001][1001];
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			scanf("%d",&a[i][j]);
		}
	}
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			scanf("%d",&book[i][j]);
		}
	}
	vector<int>a1,b; 
	for(int i=1;i<=n;++i)
	{
		int y=i,j=1;
		while(y>0 && j <=m)
		{
			a1.push_back(a[y][j]);
			b.push_back(book[y][j]);
			y--;
			j++;
		}
		sort(a1.begin(),a1.end());
		sort(b.begin(),b.end());
		if(a1 != b)
		{
			printf("NO\n");return 0;
		}
		a1.clear();
		b.clear();
	}
	for(int i=2;i<=m;++i)
	{
		int gg=i,yy=n;
		while(gg<=m && yy>0)
		{
			a1.push_back(a[yy][gg]);
			b.push_back(book[yy][gg]);
			yy--;
			gg++;
		}
		sort(a1.begin(),a1.end());
		sort(b.begin(),b.end());
		if(a1 != b)
		{
			printf("NO\n");return 0;
		}
		a1.clear();
		b.clear();
	}
		
		printf("YES\n");
	return 0;
}