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

int shipX[16], shipY[16];
int shipDistances[16][16];
int heightMap[256][256];

int dArr[256][256];

int N, K;

int getDist(int posX, int posY, int vX, int vY)
{
    if (heightMap[posX][posY]<heightMap[posX+vX][posY+vY])
        return 1 + (heightMap[posX+vX][posY+vY]-heightMap[posX][posY])*(heightMap[posX+vX][posY+vY]-heightMap[posX][posY]);
    else
        return 1 + (heightMap[posX][posY] - heightMap[posX+vX][posY+vY]);
}

void recurse(int posX, int posY, int dist)
{
    //cout<<posX<<' '<<posY<<' '<<dist<<endl;
    //cout<<dArr[posX][posY]<<endl;
    if (heightMap[posX][posY] == -1 || dist>=dArr[posX][posY])
        return;

    dArr[posX][posY] = dist;

    recurse(posX+1, posY, dist+getDist(posX, posY, 1, 0));
    recurse(posX-1, posY, dist+getDist(posX, posY, -1, 0));
    recurse(posX, posY+1, dist+getDist(posX, posY, 0, 1));
    recurse(posX, posY-1, dist+getDist(posX, posY, 0, -1));
}

void dijkstra(int shipNum)
{
    //cout<<"Calculating ship "<<shipNum<<endl;

    for (int i=0;i<=N+1;i++)
        for (int j=0;j<=N+1;j++)
            dArr[i][j] = 1<<30;

    recurse(shipX[shipNum], shipY[shipNum], 0);

    for (int i=0;i<=K;i++)
        shipDistances[shipNum][i] = dArr[shipX[i]][shipY[i]];

    /*for (int i=1;i<=N;i++)
    {
        for (int j=1;j<=N;j++)
            cout<<dArr[i][j]<<' ';
        cout<<endl;
    }*/

    //char c;
    //cin.get(c);
}

int main()
{
    ifstream in("invaders.in");
    ofstream of("invaders.out");


    in>>N>>K;

    memset(heightMap, -1, sizeof(heightMap[0][0])*256*256);

    //cout<<heightMap[100][100]<<endl;

    for (int i=1;i<=N;i++)
        for (int j=1;j<=N;j++)
            in>>heightMap[i][j];

    for (int i=0;i<=K;i++)
        in>>shipX[i]>>shipY[i];

    for (int i=0;i<=K;i++)
    {
        dijkstra(i);
    }

    /*for (int i=0;i<=K;i++)
    {
        for (int j=0;j<=K;j++)
            cout<<shipDistances[i][j]<<' ';
        cout<<endl;
    }*/

    vector<int> hue;
    for (int i=1;i<=K;i++)
        hue.push_back(i);
    int best = 1<<30;

    do
    {
        int curr_dist = shipDistances[0][hue[0]];
        for (int i=0;i<hue.size()-1;i++)
            curr_dist+= shipDistances[hue[i]][hue[i+1]];

        if (curr_dist<best)
            best = curr_dist;
        /*for (int i=0;i<hue.size();i++)
            cout<<hue[i]<<' ';
        cout<<endl;
        cout<<curr_dist<<endl;*/
    }
    while (next_permutation(hue.begin(), hue.end()));

    of<<best<<endl;

    return 0;
}