#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<queue>

#define eps 1e-6

#define inf 1e9

using namespace std;

int const xn=,xm=,xe=5e4;//

int n,m,s,t,w[xn][xn],sid[xn][xn][xn][xn],S,T;

int dis[xm],hd[xm],ct=,to[xe],nxt[xe],cur[xm];

int e1[xn][xn],e2[xn][xn];

double ans,c[xe],sum;

queue<int>q;

void add(int x,int y,double z)

{

    to[++ct]=y; nxt[ct]=hd[x]; c[ct]=z; hd[x]=ct;

    to[++ct]=x; nxt[ct]=hd[y]; c[ct]=; hd[y]=ct;

}

int rd()

{

    int ret=,f=; char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

    while(ch>=''&&ch<='')ret=(ret<<)+(ret<<)+ch-'',ch=getchar();

    return f?ret:-ret;

}

int id(int x,int y){return (x-)*m+y;}

int P(int x,int y){return (x-)*m+y;}

bool bfs()

{

    while(q.size())q.pop();

    memset(dis,,sizeof dis);

    dis[s]=; q.push(s);

    while(q.size())

    {

        int x=q.front(); q.pop();

        for(int i=hd[x],u;i;i=nxt[i])

            if(!dis[u=to[i]]&&c[i]>eps)dis[u]=dis[x]+,q.push(u);

    }

    return dis[t];

}

double dfs(int x,double fl)

{

    if(x==t)return fl;

    double ret=;

    for(int &i=cur[x],u;i;i=nxt[i])

    {

        if(dis[u=to[i]]!=dis[x]+||c[i]<=eps)continue;

        double tmp=dfs(u,min(fl-ret,c[i]));

        if(tmp<eps)dis[u]=;

        c[i]-=tmp; c[i^]+=tmp;

        ret+=tmp; if(fl-ret<eps)return ret;

    }

    return ret;

}

bool ck(double k)

{

    memset(hd,,sizeof hd); ct=;//=1 而不是 0 !!!!!!!!!!!!!!!!!!!!!!!

    s=; t=n*m+;

    for(int i=;i<=n;i++)

        for(int j=;j<=m;j++)

        {

            int x=id(i,j);

            add(s,x,w[i][j]);

            if(i==)add(x,t,sid[i-][j][i][j]*k);

            if(j==)add(x,t,sid[i][j-][i][j]*k);

            if(i==n)add(x,t,sid[i][j][i+][j]*k);

            if(j==m)add(x,t,sid[i][j][i][j+]*k);

            int y=id(i+,j),z=id(i,j+);

            if(i<n)add(x,y,k*sid[i][j][i+][j]),add(y,x,k*sid[i][j][i+][j]);

            if(j<m)add(x,z,k*sid[i][j][i][j+]),add(z,x,k*sid[i][j][i][j+]);//k*!!!

        }

    double ans=;

    while(bfs())

    {

        memcpy(cur,hd,sizeof hd);

        ans+=dfs(,inf);

    }

    return sum-ans>eps;

}

int main()

{

    n=rd(); m=rd(); s=; t=n*m+; double l=,r=;

    for(int i=;i<=n;i++)

        for(int j=;j<=m;j++)w[i][j]=rd(),r+=w[i][j],sum+=w[i][j];

    for(int i=;i<=n+;i++)

        for(int j=;j<=m;j++)sid[i-][j][i][j]=rd();

    for(int i=;i<=n;i++)

        for(int j=;j<=m+;j++)sid[i][j-][i][j]=rd();

    while(l-r<=eps)

    {

        double mid=(l+r)*0.5;

        if(ck(mid))ans=mid,l=mid+eps;

        else r=mid-eps;

    }

    printf("%.3lf\n",ans);

    return ;

}