#include<cstdio>
#include<algorithm>
using namespace std;

struct Node{
	int x,y;
}Mapping[1005000];

int Map[1050][1050];
int color[1050][1050];
int cal[1050][1050];
int L[1050],R[1050];
int flag = 1;
int n,m;

void findheight(int x,int y){
	if(color[x][y] == color[x-1][y]){
		cal[x][y] = cal[x-1][y]+1;
	}
	else{
		cal[x][y] = 1;
	}
}

int find(int x,int y){

	while(cal[x][L[y]-1]>=cal[x][y] and color[x][L[y] - 1] == color[x][y]) L[y] = L[y] - 1;
	while(cal[x][R[y]+1]>=cal[x][y] and color[x][R[y] + 1] == color[x][y]) R[y] = R[y] + 1;
	return (R[y] - L[y] + 1)*cal[x][y];
}

int fillcolor(int x,int y){
	if(color[x][y] == 0)
		color[x][y] = flag++;
	if(Map[x][y] == Map[x-1][y] + m)
		color[x-1][y] = color[x][y];
	if(Map[x][y] == Map[x][y-1] + 1)
		color[x][y-1] = color[x][y];
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			scanf("%d",&Map[i][j]);
			Mapping[Map[i][j]].x = i;
			Mapping[Map[i][j]].y = j;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			int p;
			scanf("%d",&p);
			Map[i][j] = (Mapping[p].x-1) * m + Mapping[p].y;
		}
		Map[i][0] = 2147483647;
	}
	int Ans = 0;
	for(int i=n;i>=1;i--){
		for(int j=m;j>=1;j--){
			fillcolor(i,j);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			L[j] = R[j] = j;
			findheight(i,j);
		}
		for(int j=1;j<=m;j++){
			Ans = max(Ans,find(i,j));
		}
	}
	printf("%d\n",Ans);
	return 0;
}

/*
3 4

 5  6  7  8
 1  2  3  4
 9 10 11 12

 5  6  8  7
 1  2  4  3
12 11 10  9



*/