// 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: 1.1705809597920291x):
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1024;



int h, w, n, maze[MAX][MAX];

int b[15];

int r[] = {1, -1, 0, 0};

int z[] = {0, 0, -1, 1};

int d[MAX][MAX];

int ans = 0;



int readchar() {

    for(;;) {

        int ch = getchar();

        if(ch != '\n' && ch != '\r') return ch;

    }

}



int bfs(int x, int y, int x2, int y2)

{

    //cout << x << y << x2 << y2 << endl;



    queue<int> q;

    q.push(x * 10000 + y);

    while(!q.empty()) {

        int v = q.front();

        q.pop();

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

            int x1 = v / 10000 + r[i];

            int y1 = v % 10000 + z[i];

            if(x1 == x2 && y1 == y2) {

                d[x1][y1] = d[v / 10000][v % 10000] + 1;

                return 0;

            }

            if(x1 >= 0 && y1 >= 0 && x1 < h && y1 < w && maze[x1][y1] != 'X' && d[x1][y1] == -1) {

                 d[x1][y1] = d[v / 10000][v % 10000] + 1;

                 q.push(x1 * 10000 + y1);

            }

        }

    }

    return 0;

}

int main()

{

    cin >> h >> w >> n;

    for(int i = 0; i < h; ++i)

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

             maze[i][j] = readchar();

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

            b[0] = i * 10000 + j;

        }

        if(maze[i][j] != 'S' && maze[i][j] != 'X' && maze[i][j] != '.') {

            b[maze[i][j] - '0'] = i * 10000 + j;

        }

    }

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

        memset(d, -1, sizeof(d));

        d[b[i] / 10000][b[i] % 10000] = 0;

        bfs(b[i] / 10000, b[i] % 10000, b[i + 1] / 10000, b[i + 1] % 10000);

        ans += d[b[i + 1] / 10000][ b[i + 1] % 10000];

    }

    cout << ans << endl;

    return 0;

}