#include<cstdio>

 #include<iostream>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #define ll long long

 const ll inf=1e18;

 ll f[][],bin[],sum[],ans;

 ll a[][],b[][],c1[][],c2[][];

 ll s[];

 int n,m;

 ll read(){

     ll t=,f=;char ch=getchar();

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

     while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}

     return t*f;

 }

 ll query(int id,int j,int st){

     int top=;

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

         s[++top]=st%;

         st/=;

     }

     s[]=s[top];s[top+]=s[];

     ll res=;

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

      res+=((s[i]*bin[id])^(a[i][j]&bin[id]))*b[i][j];

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

      res+=((s[i]*bin[id])^(bin[id]*s[i+]))*c2[i][j];

     return res;

 }

 void dp(int id){

     int tot=(<<n)-,cnt=;

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

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

       f[i][j]=inf;

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

      f[n][i]=query(id,,i);

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

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

         int now=(j-)*n+i,pre=now-;

         for (int st=;st<=tot;st++){

             int st1=st&sum[n-],lst=((st&bin[n-])>),ths=((st&bin[n-])>);

             ll tmp=;

             if (i!=) tmp+=((lst^ths)*c2[i-][j])*bin[id];

             if (i==n) tmp+=(((st&bin[])^ths)*c2[i][j])*bin[id];

             tmp+=((a[i][j]&bin[id])^(ths*bin[id]))*b[i][j];

             for (int k=;k<=;k++){

                 int st2=st1*+k,beh=((st2&bin[])>);

                 ll tmp2=(beh^ths)*bin[id]*c1[i][j-];

                 f[now][st]=std::min(f[now][st],f[pre][st2]+tmp+tmp2);

             }

         }

      }

      ll Tmp=inf;

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

       Tmp=std::min(f[n*m][i],Tmp);

      ans+=Tmp;

 }

 int main(){

     n=read();m=read();bin[]=;

     for (int i=;i<=;i++) bin[i]=bin[i-]*;sum[]=bin[];

     for (int i=;i<=;i++) sum[i]=sum[i-]+bin[i];

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

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

       a[i][j]=read();

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

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

       b[i][j]=read();

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

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

       c1[i][j]=read();

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

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

       c2[i][j]=read();

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

         dp(i);

     }

     printf("%I64d\n",ans);

     fclose(stdin);fclose(stdout);

     return ;

 }