/*
  PROB:BC #63 t3 
  TIME:151121 eve
*/
//  #define me AcrossTheSky
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <string>
using namespace std;

int ma[2000][2000],f[2000][2000];

int min(int x,int y,int z){
    if (x>y) x=y;
    if (z<x) x=z;
    return x;
}

int main(){
    int n,m;
    while (scanf("%d%d",&n,&m)!=EOF){
        for (int i=1;i<=n;i++)
            for (int j=1;j<=m;j++) scanf("%d",&ma[i][j]);
        memset(f,0x7f,sizeof(f));
        f[0][0]=0; f[1][0]=0; f[0][1]=0;
        for (int i=1;i<=m;i++) if (i%2==1) f[1][i]=f[1][i-1];
                                else f[1][i]=f[1][i-1]+ma[1][i-1]*ma[1][i];
        for (int i=1;i<=n;i++) if (i%2==1) f[i][1]=f[i-1][1];
                                else f[i][1]=f[i-1][1]+ma[i-1][1]*ma[i][1];
        for (int i=2;i<=n;i++)
            for (int j=2;j<=m;j++)
            if ((i+j)%2==1)
                f[i][j]=min(f[i][j],f[i-1][j]+ma[i-1][j]*ma[i][j],f[i][j-1]+ma[i][j-1]*ma[i][j]);
            else (f[i][j]=min(f[i][j],f[i-1][j],f[i][j-1]));        
        cout << f[n][m] << endl;
    }
}