#include <bits/stdc++.h>
#define NMAX 1002
using namespace std;

ifstream fin("taxa.in");
ofstream fout("taxa.out");

int n,m,a[NMAX][NMAX],b[NMAX][NMAX],lo,co,lf,cf,cost;
int dx[]={-1,-1,-1,0,1,1,1,0};
int dy[]={-1,0,1,1,1,0,-1,-1};

void citire()
{
    int i,j;
    fin>>n>>m>>lo>>co>>lf>>cf;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            fin>>a[i][j];
        }
    }
}

void afisare(int a[][NMAX])
{
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            cout<<a[i][j]<<" ";
        }
        cout<<endl;
    }
}

struct punct{
    int x,y;
}c[NMAX*NMAX];

int interior(int x,int y)
{
    if(x>=1&&y>=1&&x<=n&&y<=m) return 1;
    return 0;
}

void Lee(int x,int y)
{
    int i,j,p,u,xv,yv;
    p=u=1;
    c[p].x=x;
    c[p].y=y;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            b[i][j]=INT_MAX;
        }
    }
    b[x][y]=0;
    while(p<=u)
    {
        x=c[p].x;
        y=c[p++].y;
        for(i=0;i<=7;i++)
        {
            xv=x+dx[i]; yv=y+dy[i];
            if(interior(xv,yv))
            {
                cost=0;
                if(a[xv][yv]!=a[x][y]) cost=a[xv][yv]*a[x][y];
                if(b[xv][yv]>b[x][y]+cost) b[xv][yv]=b[x][y]+cost,c[++u].x=xv, c[u].y=yv;
            }
        }
    }
}

int main()
{
    int i,j;
    citire();
    Lee(lo,co);
    afisare(b);
    fout<<b[lf][cf];
    return 0;
}