#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <ctime>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>

#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ld eps = 1e-9;

int n,k;
int fld[201][201];
int A,B;
vector<pair<int, int> > ufos;
vector<pair<pair<int,int>, int> > nbs[200][200];

int newGraph[10][10];

int MOVE[][2] = {{0,1},{0,-1},{-1,0},{1,0}};

//fill nbsGraph
void fillNbsGraph() {
	for (int i=0;i<n;++i){
		for (int j=0;j<n;++j) {
			for (int z=0;z<4;++z) {
				int ny=i+MOVE[z][0];
				int nx=j+MOVE[z][1];
				if (nx<0||nx>=n||ny<0||ny>=n)continue;
				int delta;int X=fld[i][j]; int Y=fld[ny][nx];
				if (X>=Y)delta=1+X-Y;
				else delta = 1+(Y-X)*(Y-X);
/*
fprintf(stderr,"dist from %d,%d to %d,%d is : %d\n",
i,j,ny,nx,delta);
*/
				nbs[i][j].push_back(make_pair(make_pair(ny,nx),delta));
			}
		}
	}
}

int dist[200][200];
bool vis[200][200];
//find shortestPathToAll
void findShortestFromToAll(int fromI, int fromJ) {
	int y,x,curDist,i,nbY,nbX,nbD,nbsz,*dstnynx;
	vector<pair<pair<int,int>, int> >* nbbb;
	pair<pair<int,int>,int>* ppp;
	priority_queue<pair<int,pair<int,int> > > pq;
	memset(dist,-1,sizeof(dist));
	dist[fromI][fromJ]=0;
	memset(vis,0,sizeof(vis));
	pq.push(make_pair(0, make_pair(fromI,fromJ)));
	while(!pq.empty()) {
		pair<int,pair<int, int> > tp = pq.top(); pq.pop();
		y=tp.second.first; x = tp.second.second;
		curDist = -tp.first;
		if (vis[y][x]) continue;
		nbbb = &nbs[y][x];
		nbsz = nbbb->size();
		for (i=0;i<nbsz; ++i) {
			ppp=&(nbbb->at(i));
			nbY=ppp->first.first;
			nbX=ppp->first.second;
			nbD=ppp->second;
			if (vis[nbY][nbX])continue;
			dstnynx=&dist[nbY][nbX];
			if (*dstnynx==-1 || *dstnynx>curDist+nbD) {
				*dstnynx=curDist+nbD;
				pq.push(make_pair(-*dstnynx,make_pair(nbY,nbX)));
			}
		}
	}
}

//makeNewGraph
void makeNewGraph() {
	for (int i=0;i<ufos.size();++i) {
		findShortestFromToAll(ufos[i].first,ufos[i].second);
		for (int j=0;j<ufos.size();++j) {
			if (i==j)continue;
			int sp = dist[ufos[j].first][ufos[j].second];
/*
fprintf(stderr,"shortestPathFrom %d,%d to %d,%d is %d\n",
ufos[i].first,ufos[i].second,ufos[j].first,ufos[j].second,sp);
*/
			newGraph[i][j] = sp;
			//newGraph[i].push_back(make_pair(sp,j));
		}
	}
}
//makeMPD
int findRes() {
	int res = 2000000000;
	vector<int> perms;
	for (int i = 1; i <=k;++i)perms.push_back(i);

	// for each perm
	do {
		int curRes = newGraph[0][perms[0]];
		for (int i=1;i<perms.size();++i) {
			curRes += newGraph[perms[i-1]][perms[i]];			
		}
		res=min(res,curRes);
	}while(next_permutation(all(perms)));
	return res;
}

int main()
{
	freopen("invaders.in","r",stdin);
	freopen("invaders.out","w",stdout);

	scanf("%d %d", &n, &k);
	for (int i=0;i<n;++i){
		for (int j=0;j<n;++j) scanf("%d",&fld[i][j]);
	}
	scanf("%d %d",&A,&B);
	ufos.push_back(make_pair(--A,--B));
	int y,x;
	for (int i=0;i<k;++i) {
		scanf("%d %d", &y, &x);
		ufos.push_back(make_pair(--y,--x));
	}
	fillNbsGraph();
	makeNewGraph();
	printf("%d\n",findRes());
	return 0;
}