// Slower C++ solution:
//

// Create by 神舟 on 2015-02-21

//



#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <cstdlib>

#include <algorithm>

#include <cctype>

#include <stack>

#include <queue>

#include <map>

#include <string>

#include <set>

#include <vector>

using namespace std;



#define CLR(x) memset(x,0,sizeof x)

#define ll long long

#define inf 0x3f3f3f3f

const int maxn=1e3+5;

const int MOD=5e5+5;

int n,m,t,sx,sy,ex,ey;

char word[maxn][maxn];

int path[maxn][maxn];

int ans,dir[4][2]={0,1,1,0,-1,0,0,-1};



struct pnt

{

    int x,y;

    pnt(int x=0,int y=0):x(x),y(y){};

};



void bfs()

{

    memset(path,0x3f,sizeof path);

    queue <pnt> que;

    pnt p,np;

    p.x=sx,p.y=sy;

    path[sx][sy]=0;

    que.push(p);

    while(!que.empty()){

        p=que.front();que.pop();

        if(p.x==ex&&p.y==ey) {return;}

        for(int i=0;i<4;i++){

            np.x=p.x+dir[i][0];

            np.y=p.y+dir[i][1];

            if(np.x>0 && np.x<=n && np.y>0 && np.y<=m && path[np.x][np.y]>path[p.x][p.y]+1 && word[np.x][np.y]!='X')

            {

                path[np.x][np.y]=path[p.x][p.y]+1;

                que.push(np);

            }

        }

    }

}

int main()

{

#ifdef LOCAL

	freopen("in.txt","r",stdin);

	//freopen("out.txt","w",stdout);

#endif

	ios_base::sync_with_stdio(0);



	while(scanf("%d%d%d",&n,&m,&t)!=EOF){

        ans=0;

        CLR(word);

        for(int i=1;i<=n;scanf("%s",word[i++]+1));

        for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(word[i][j]=='S') word[i][j]='0';

        for(int k=0;k<t;k++){

            char tp=k+'0';

            for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){

                if(word[i][j]==tp) sx=i,sy=j;

                if(word[i][j]==tp+1) ex=i,ey=j;

            }

            bfs();

            ans+=path[ex][ey];

            //printf("%d\t",path[ex][ey]);

        }

        printf("%d\n",ans);

	}



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.0113264485151148x):
#include <iostream>

#include <stdlib.h>

#include <queue>

#include <cstring>

#define MAX_NUM 1010

using namespace std;

int H, W, N;

bool flag[MAX_NUM][MAX_NUM] = {false};                            //??是否已遍??

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



class Node {

  public:

    Node();

    Node(int x, int y, int step);

    ~Node();

    int x;

    int y;

    int step;

};



Node::Node() {

}



Node::Node(int x, int y, int step) {

    this->x = x;

    this->y = y;

    this->step = step;

}



Node::~Node() {

}



int BFS(char map[][MAX_NUM], int sx, int sy, int ex, int ey) {

    queue<Node> que;                                                  //第一次出?Memory Limit Exceeded,一定不能使用new来?行?建

    Node node(sx, sy, 0);

    que.push(node);

    flag[sx][sy] = true;                                              //将遍?的?点?置?true



    while(!que.empty()) {

        Node cur = que.front();

        que.pop();



        if(cur.x == ex && cur.y == ey) {

            return cur.step;



        } else {

            for(int i = 0; i < 4; i++) {

                int k = cur.x + dir[i][0];

                int v = cur.y + dir[i][1];



                if(k >= 0 && k < H && v >= 0 && v < W && map[k][v] != 'X' && !flag[k][v]) { //将可到?并且尚未遍?的?点加入?列

                    Node temp(k, v, cur.step + 1);

                    que.push(temp);

                    flag[k][v] = true;

                }

            }

        }

    }



    return -1;

}



int main() {

    int sx, sy, arr[10][2];

    char map[MAX_NUM][MAX_NUM];



    if(cin >> H >> W >> N && H && W) {

        for(int i = 0; i < H; i++) {

            for(int j = 0; j < W; j++) {

                cin >> map[i][j];



                if(map[i][j] == 'S') {

                    map[i][j] = '.';

                    sx = i;

                    sy = j;

                }



                if(isdigit(map[i][j])) {

                    int index = map[i][j] - '0';

                    arr[index][0] = i;

                    arr[index][1] = j;

                }

            }

        }



        arr[0][0] = sx;

        arr[0][1] = sy;

        int res = 0;



        for(int i = 0; i + 1 <= N; i++) {

            memset(flag, false, sizeof(flag));

            res += BFS(map, arr[i][0], arr[i][1], arr[i + 1][0], arr[i + 1][1]);

        }



        cout << res << endl;

    }



    return 0;

}