// 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: 6.143677131631256x):
#include <iostream>

#include <stdio.h>

#include <deque>



using namespace std;



const int INF = 0x3f3f3f3f;

typedef pair<int, int> P;

int h, w, n;

int sx, sy;

int gx, gy;

char cmap[1000][1000];

int goalSum;

int goal[10];

int d[1000][1000];

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

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



int bfs() {

    int res = 0;

    deque<P> que;

    for (int ci = 0; ci < n; ci++) {  //要?行n次循?，?找n次?点，?次?数?入goal[i], 最后累加起来是res 

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

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

                d[i][j] = INF;

            }

        }

        

        que.push_back(P(sx, sy));

        d[sx][sy] = 0;

        

        while(que.size()) {            

            int x = que.front().first;

            int y = que.front().second;

                        

            if ((int)cmap[x][y] == 49 + ci) {

                goal[ci] = d[x][y];

                sx = x;

                sy = y;

                break;

            }

            

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

                int nx = x + dx[i];

                int ny = y + dy[i];

                if (nx >=0 && nx < h && ny >= 0 && ny < w && cmap[nx][ny] != 'X' && d[nx][ny] == INF) {

                    que.push_back(P(nx, ny));

                    d[nx][ny] = d[x][y] + 1;

                }

            }    

            que.pop_front();        

        }

        que.clear(); 

        res += goal[ci];

    }

    return res;

}



int main() {

    cin >> h >> w >> n;

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

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

            cin >> cmap[i][j];

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

                sx = i;

                sy = j;

            }

        }

    }

    goalSum = bfs();

    cout << goalSum << endl;

    return 0;

}