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

#include <cstdio>

#include <cstdlib>

#include <queue>

using namespace std;



const int N = 1000;

const int INF = 0x3f3f3f3f;



int n, m, f;

char map[N][N+1];



bool legal(int x, int y, int k)

{

    return x >= 0 && x < n && y >= 0 && y < m

        && map[x][y] != 'X';

}



void input()

{

    cin >> n >> m >> f;

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

        scanf("%s", map[i]);

    }

}



int BFS(int k)

{

    int i, j;

    int d[N][N];

    typedef pair<int, int> P;

    queue <P> q;

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

        for (j = 0; j < m; j ++) {

            d[i][j] = INF;

            if ((k == 0 && map[i][j] == 'S') || map[i][j] == '0'+k) {

                q.push(P(i, j));

                d[i][j] = 0;

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

            }

        }

    }



    while( q.size() ) {

        P p = q.front();

        q.pop();

        int x = p.first;

        int y = p.second;



        if (map[x][y] == INF)

            return d[x][y];



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

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

            int nx = x + pos[i][0];

            int ny = y + pos[i][1];

            if (legal(nx, ny, k) && d[nx][ny] == INF) {

                q.push(P(nx, ny));

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

                if (map[nx][ny] == '0'+k+1) {

                    return d[nx][ny];

                }

            }

        }

    }



    return INF;

}



void solve()

{

    int res = 0;

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

        res += BFS(i);

    }

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

}



int main(void)

{

    input();



    solve();



    return 0;

}