// luogu-judger-enable-o2

#include<bits/stdc++.h>

using namespace std;

#define lf double

#define il inline

#define gc getchar()

#define t(i) edge[i].to

#define w(i) edge[i].wei

#define n(i) edge[i].nxt

#define ri register int

#define rb register int

#define rc register char

#define rp(i,x,y) for(int i=x;i<=y;++i)

#define my(i,x,y) for(int i=x;i>=y;--i)

#define e(i,x) for(int i=head[x];~i;i=n(i))

const int N=1e4+,M=;

const lf eps=1e-,inf=1e9;

int n,m,dep[N],head[N],cur[N],S,T,ed_cnt=-,val[M][M],h[M][M],s[M][M];

lf l,r=,sum;

struct ed{int to,nxt;lf wei;}edge[N<<];

il int read()

{

    rc ch=gc;ri x=;rb y=;

    while(ch!='-' && (ch>'' || ch<''))ch=gc;

    if(ch=='-')ch=gc,y=;

    while(ch>='' && ch<='')x=(x<<)+(x<<)+(ch^''),ch=gc;

    return y?x:-x;

}

il int nam(ri x,ri y){return (x-)*m+y;}

il void ad(ri x,ri y,lf z)

{

    //printf("%d -> %d : %.3lf\n",y,x,z);

    edge[++ed_cnt]=(ed){x,head[y],z};head[y]=ed_cnt;edge[++ed_cnt]=(ed){y,head[x],};head[x]=ed_cnt;}

il bool bfs()

{

    queue<int>Q;Q.push(S);memset(dep,,sizeof(dep));dep[S]=;

    while(!Q.empty())

    {ri nw=Q.front();Q.pop();e(i,nw)if(w(i)>eps && !dep[t(i)]){dep[t(i)]=dep[nw]+,Q.push(t(i));if(t(i)==T)return ;}}

    return ;

}

lf dfs(ri nw,lf flow)

{

    if(nw==T || flow<eps)return flow;lf ret=;

    for(ri &i=cur[nw];~i;i=n(i))

        if(w(i)>eps && dep[t(i)]==dep[nw]+)

        {lf tmp=dfs(t(i),min(flow,w(i)));ret+=tmp,w(i)-=tmp;w(i^)+=tmp,flow-=tmp;}

    if(ret<eps)dep[nw]=;

    return ret;

}

il lf dinic(){lf ret=;while(bfs()){rp(i,S,T)cur[i]=head[i];while(){lf d=dfs(S,inf);ret+=d;if(d<=eps)break;}}return ret;}

il bool check(lf mid)

{

    memset(head,-,sizeof(head));ed_cnt=-;

    rp(i,,n)rp(j,,m)ad(nam(i,j),S,val[i][j]);

    rp(i,,n-)rp(j,,m)ad(nam(i+,j),nam(i,j),mid*h[i][j]),ad(nam(i,j),nam(i+,j),mid*h[i][j]);

    rp(i,,n)rp(j,,m-)ad(nam(i,j),nam(i,j+),mid*s[i][j]),ad(nam(i,j+),nam(i,j),mid*s[i][j]);

    rp(i,,m)ad(T,nam(,i),mid*h[][i]),ad(T,nam(n,i),mid*h[n][i]);//,printf("QwQ mid=%lf h=%d h=%d\n",mid,h[0][i],h[n][i]);

    rp(i,,n)ad(T,nam(i,),mid*s[i][]),ad(T,nam(i,m),mid*s[i][m]);//,printf("QwQQ mid=%lf s=%d s=%d\n",mid,s[i][0],s[i][m]);

    lf tmp=dinic();

    //printf("mid=%.3lf sum=%lf dinic()=%.3lf\n",mid,sum,tmp);

    return abs(sum-tmp)>eps;

}

int main()

{

    //freopen("3232.in","r",stdin);freopen("3232.out","w",stdout);

    n=read();m=read();S=;T=n*m+;

    rp(i,,n)rp(j,,m)sum+=(val[i][j]=read());rp(i,,n)rp(j,,m)h[i][j]=read();rp(i,,n)rp(j,,m)s[i][j]=read();

    while(r-l>eps){lf mid=(l+r)/;if(check(mid))l=mid;else r=mid;}

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

    return ;

}