#include <iostream>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
using namespace std;
const int INF = 999999999;
struct Point
{
    int x,y;
} p[15];
int n,m,res,cnt;
int graph[15][15];
bool vis[15];
void dfs(int x,int dept,int ans)
{
    vis[x] = true;
    if(ans>res) return ; ///剪枝
    if(dept==cnt-1)
    {
        ans += graph[x][0]; ///走回去
        res = min(res,ans);
        return ;
    }
    for(int i=0; i<cnt; i++)
    {
        if(!vis[i]&&graph[x][i]!=INF&&x!=i)
        {
            dfs(i,dept+1,ans+graph[x][i]);
            vis[i] = false;
        }
    }
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        cnt = 0;
        int v;
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                scanf("%d",&v);
                if(i==0&&j==0)
                {
                    p[cnt].x = i,p[cnt++].y=j;
                }
                else if(v)
                {
                    p[cnt].x = i,p[cnt++].y=j;
                }
            }
        }
        for(int i=0; i<cnt; i++)
        {
            for(int j=0; j<cnt; j++)
            {
                if(i==j)graph[i][j] = 0;
                else graph[i][j] =INF;
            }
        }
        for(int i=0; i<cnt; i++)
        {
            for(int j=i+1; j<cnt; j++)
            {
                graph[i][j] = graph[j][i] = abs(p[i].x-p[j].x)+abs(p[i].y-p[j].y);
            }
        }
        /*for(int i=0; i<cnt; i++)
        {
            for(int j=0; j<cnt; j++)
            {
                printf("%d ",graph[i][j]);
            }
            printf("\n");
        }*/
        memset(vis,false,sizeof(vis));
        res = INF;
        vis[0] = true;
        dfs(0,0,0);
        printf("%d\n",res);
    }
    return 0;
}