1 #include<set>
 2 #include<map>
 3 #include<queue>
 4 #include<stack>
 5 #include<cstdio>
 6 #include<cstring>
 7 #include<iostream>
 8 #include<algorithm>
 9 #define inf (1<<30)
10 #define ll long long
11 #define RG register int
12 #define rep(i,a,b)    for(RG i=a;i<=b;i++)
13 #define per(i,a,b)    for(RG i=a;i>=b;i--)
14 #define maxn 1005
15 #define add(x,y) e[++cnt].v=y,e[cnt].next=head[x],head[x]=cnt
16 using namespace std;
17 typedef pair<int,int> pir;
18 int n,m,id,cnt;
19 int h[maxn][maxn],val[maxn][maxn],head[maxn*maxn];
20 int rec[maxn][maxn];
21 int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
22 ll ans,V[maxn*maxn],f[maxn*maxn];
23 struct E{
24     int v,next;
25 }e[4000005];
26 inline int read()
27 {
28     int x=0,f=1;char c=getchar();
29     while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
30     while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
31     return x*f;
32 }
33
34 void DO(int x,int y)
35 {
36     ++id;int num=0;
37     queue<pir> que;
38     que.push((pir){x,y});
39     pir u;int tx,ty;
40     while(!que.empty())
41     {
42         u=que.front();que.pop(),++num;
43         rec[u.first][u.second]=id,V[id]+=val[u.first][u.second];
44         rep(i,0,3)
45         {
46             tx=u.first+dir[i][0],ty=u.second+dir[i][1];
47             if(tx<1||tx>n||ty<1||ty>m)    continue;
48             if(rec[tx][ty])                continue;
49             if(h[tx][ty]!=h[u.first][u.second])    continue;
50             que.push((pir){tx,ty});
51         }
52     }
53     if(num>1)    V[id]<<=1;
54 }
55
56 ll LongPath(int u)
57 {
58     if(f[u]!=-1)    return f[u];
59     f[u]=0;
60     for(int i=head[u];i;i=e[i].next)
61     {
62         f[u]=max(f[u],LongPath(e[i].v));
63     }
64     f[u]+=V[u];
65     return f[u];
66 }
67
68 int main()
69 {
70     freopen("road.in","r",stdin);
71     freopen("road.out","w",stdout);
72     n=read(),m=read();
73     rep(i,1,n)rep(j,1,m)    h[i][j]=read();
74     rep(i,1,n)rep(j,1,m)    val[i][j]=read();
75     rep(i,1,n)rep(j,1,m)    if(!rec[i][j])    DO(i,j);
76     int tx,ty;
77     rep(x,1,n)rep(y,1,m)rep(i,0,3)
78     {
79         tx=x+dir[i][0],ty=y+dir[i][1];
80         if(tx<1||tx>n||ty<1||ty>m||h[tx][ty]>=h[x][y])    continue;
81         add(rec[x][y],rec[tx][ty]);
82     }
83     memset(f,-1,sizeof(f));
84     rep(i,1,id) ans=max(ans,LongPath(i));
85     cout<<ans;
86     return 0;
87 }