Problem: Let us remind you the rules of a very popular game called "Snake" (or sometimes "Boa", "Python" or "Worm").

The game field is represented by an n × m rectangular table. Some squares of the field are considered impassable (walls), all other squares of the fields are passable.

You control a snake, the snake consists of segments. Each segment takes up exactly one passable square of the field, but any passable square contains at most one segment. All segments are indexed by integers from 1 to k, where k is the snake's length. The 1-th segment is the head and the k-th segment is the tail. For any i (1 ≤ i < k), segments with indexes i and i + 1 are located in the adjacent squares of the field, that is, these squares share a common side.

One of the passable field squares contains an apple. The snake's aim is to reach the apple and eat it (that is, to position its head in the square with the apple).

The snake moves throughout the game. During one move the snake can move its head to an adjacent field square. All other segments follow the head. That is, each segment number i (1 < i ≤ k) moves to the square that has just had segment number i - 1. Consider that all segments including the head move simultaneously (see the second test sample). If the snake's head moves to an unpassable square or to the square, occupied by its other segment, the snake dies. That's why we will consider such moves unvalid.

Your task is to determine the minimum number of valid moves that the snake needs to reach the apple.

Input

The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 15) — the number of rows and columns of the game field.

Next n lines describe the game field. Each of these lines contains m characters. Character "#" represents a wall, "." is a passable square, "@" is an apple. The snake's first segment is represented by character "1", the second one segment — by character "2" and so on.

The game field description doesn't contain any characters besides "#', ".", "@" and digits (except 0). It is guaranteed that the described field is correct. It is guaranteed that the described field contains exactly one apple and exactly one snake, the snake's length is at least 3 and at most 9.

Output

Print a single integer to the output — the minimum number of moves needed to reach the apple. If the snake can't reach the apple, print -1.

Examples

Input

4 5
##...
..1#@
432#.
...#.


Output

4


Input

4 4
#78#
.612
.543
..@.


Output

6


Input

3 2
3@
2#
1#


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct node {
  int hx, hy;
  int tx, ty;
  int dep;
  long dir;
  int zt[15];
};
queue<node> q;
int n, m, len;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
bool v[15][15][262144];
char c[30][30];
bool init(int a, int b) {
  if (a < 0 || a >= n || b < 0 || b >= m) return 0;
  return 1;
}
int update(int d, int nd) {
  d = d | (nd << ((len - 1) * 2));
  d >>= 2;
  return d;
}
void out(int d) {
  for (int i = 1; i < len; i++) {
    int t = d % 4;
    if (t == 0) cout << 'w';
    if (t == 1) cout << 'd';
    if (t == 2) cout << 's';
    if (t == 3) cout << 'a';
    d /= 4;
  }
}
void zut(int x) {
  for (int i = 1; i <= m; i++) {
    cout << x % 2;
    x /= 2;
  }
}
int ax, ay;
node fst;
int main() {
  cin >> n >> m;
  int fhx, fhy, ftx, fty;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      cin >> c[i][j];
      if (c[i][j] >= '1' && c[i][j] <= '9') len = max(len, c[i][j] - '0');
      if (c[i][j] == '1') {
        fhx = i;
        fhy = j;
      }
      if (c[i][j] == len + '0') {
        ftx = i;
        fty = j;
      }
      if (c[i][j] == '@') {
        ax = i;
        ay = j;
      }
    }
  int fdir = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (c[i][j] >= '1' && c[i][j] <= '9') {
        for (int k = 0; k < 4; k++) {
          int nx = i + dx[k], ny = j + dy[k];
          if (init(nx, ny) && c[nx][ny] == c[i][j] - 1) {
            int nk = k;
            fdir = fdir | (nk << ((len - (c[i][j] - '0')) * 2));
            break;
          }
        }
        fst.zt[i] |= (1 << j);
      }
  fst.dir = fdir, fst.hx = fhx, fst.hy = fhy, fst.tx = ftx, fst.ty = fty,
  fst.dep = 0;
  q.push(fst);
  while (!q.empty()) {
    node f = q.front();
    q.pop();
    if (f.hx == ax && f.hy == ay) {
      cout << f.dep;
      return 0;
    } else {
      for (int i = 0; i < 4; i++) {
        int nx = f.hx + dx[i], ny = f.hy + dy[i];
        if (!init(nx, ny)) continue;
        if (c[nx][ny] == '#') continue;
        if (f.zt[nx] & (1 << ny) && !(nx == f.tx && ny == f.ty)) continue;
        node nf = f;
        nf.hx = nx;
        nf.hy = ny;
        nf.tx = dx[f.dir & (3)] + f.tx;
        nf.ty = dy[f.dir & (3)] + f.ty;
        nf.zt[f.tx] ^= (1 << f.ty);
        nf.zt[nx] |= (1 << ny);
        nf.dir = update(f.dir, i);
        nf.dep++;
        if (v[nx][ny][nf.dir]) continue;
        v[nx][ny][nf.dir] = 1;
        q.push(nf);
      }
    }
  }
  cout << -1;
  return 0;
}