1 /*======================================================================
 2  *           Author :   kevin
 3  *            Email :   ubuntu_kevin@126.com
 4  *         Filename :   HarryAndDigMachine.cpp
 5  *       Creat time :   2014-10-29 16:35
 6  *      Description :
 7 ========================================================================*/
 8 #include <iostream>
 9 #include <algorithm>
10 #include <cstdio>
11 #include <cstring>
12 #include <queue>
13 #include <cmath>
14 #define clr(a,b) memset(a,b,sizeof(a))
15 #define INF 0x7f7f7f7f
16 #define M 15
17 using namespace std;
18 inline int min_32(int (a),int (b)){return (a)<(b)?(a):(b);}
19 inline int max_32(int (a),int (b)){return (a)>(b)?(a):(b);}
20 inline long long min_64(long long (a),long long (b)){return (a)<(b)?(a):(b);}
21 inline long long max_64(long long (a),long long (b)){return (a)>(b)?(a):(b);}
22 int n,m;
23 int dp[1<<M][M];
24 int dis[M][M];
25 struct Node
26 {
27     int x,y;
28 }node[M];
29 int main(int argc,char *argv[])
30 {
31     while(scanf("%d%d",&n,&m) != EOF){
32         int cnt = 1;
33         int a;
34         node[0].x = 0;
35         node[0].y = 0;
36         for(int i = 0; i < n; i++){
37             for(int j = 0; j < m; j++){
38                 scanf("%d",&a);
39                 if(a > 0){
40                     node[cnt].x = i;
41                     node[cnt++].y = j;
42                 }
43             }
44         }
45         for(int i = 0; i < cnt; i++){
46             for(int j = 0; j < cnt; j++){
47                 dis[i][j] = (fabs(node[i].x-node[j].x) + fabs(node[i].y-node[j].y));
48             }
49         }
50         /*
51         for(int k = 0; k < cnt; k++){
52             for(int i = 0; i < cnt; i++){
53                 for(int j = 0; j < cnt; j++){
54                     dis[i][j] = min_32(dis[i][j],dis[i][k]+dis[k][j]);
55                 }
56             }
57         }
58         */
59         clr(dp,0);
60         for(int state = 0; state < (1<<cnt); state++){
61             for(int i = 0; i < cnt; i++){
62                 if(state & (1<<(i))){
63                     if(state == (1<<(i))){
64                         dp[state][i] = dis[0][i];
65                     }
66                     else{
67                         dp[state][i] = INF;
68                         for(int j = 0; j < cnt; j++){
69                             if(i != j && state & (1<<(j))){
70                                 int t = (state ^ (1<<(i)));
71                                 dp[state][i] = min_32(dp[state][i],dp[t][j]+dis[j][i]);
72                             }
73                         }
74                     }
75                 }
76             }
77         }
78         int ans = dp[(1<<cnt)-1][0] + dis[0][0];
79         for(int i = 1; i < cnt; i++){
80             ans = min_32(ans,dp[(1<<cnt)-1][i]+dis[i][0]);
81         }
82         printf("%d\n",ans);
83     }
84     return 0;
85 }