// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<queue>

#include<algorithm>

#define MAX_N 1002

using namespace std;

struct node{int x,y;};

char _map[MAX_N][MAX_N];

int dp[MAX_N][MAX_N];

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

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

int S_x,S_y;

int h,w,cnt;



node make_node(int x,int y){

    node t;

    t.x=x,t.y=y;

    return t;

}

void solve(){

    queue<node> que;

    int step=0;



    for(int i=1;i<=cnt;i++){

        que.push(make_node(S_x,S_y));

        _map[S_x][S_y]='.';

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

        dp[S_x][S_y]=step;

        while(!que.empty()){

            node t=que.front();que.pop();

            if(_map[t.x][t.y]=='0'+i){

                step=dp[t.x][t.y];

                S_x=t.x,S_y=t.y;

                break;

            }

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

                int x=t.x+ox[j];

                int y=t.y+oy[j];

                if(0<=x&&x<h&&0<=y&&y<w&&_map[x][y]!='X'&&dp[x][y]==-1){

                    que.push(make_node(x,y));

                    dp[x][y]=dp[t.x][t.y]+1;

                }

            }

        }

        while(!que.empty()) que.pop();

    }



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

}



int main()

{

    while(scanf("%d%d%d",&h,&w,&cnt)!=EOF){

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

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

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

            for(int k=0;k<w;k++)

                if(_map[j][k]=='S')

                    S_x=j,S_y=k,j=h,k=w;

        solve();

    }

    return 0;

}


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

#include <queue>



using namespace std;



char mp[1005][1005];

int vis[1005][1005];

int w, h, n;



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

int ans = 0, sx, sy;

int blood = 1;



struct Node{

	int x,y;

	Node(int _x, int _y){

		x = _x, y = _y;

	}

}; 

typedef struct Node Node; 



queue<Node> que;



void bfs(char t){

//	cout<<"sx = "<<sx<<", sy = "<<sy<<endl;

	que.push(Node(sx, sy));

	ans = 0;

	bool flag = true;

	while(!que.empty()){

//		cout<<"ans = "<<ans<<"n = "<<n<<endl;

		int size = que.size();

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

			Node node = que.front();

			que.pop();

			int x = node.x, y = node.y;

//			cout<<"x = "<<x<<", y = "<<y<<endl;

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

				int tx = x + dirs[i][0], ty = y + dirs[i][1];

				if(tx >= 0 && tx < h && ty >= 0 && ty < w && vis[tx][ty] == 0 && mp[tx][ty] == t){

					sx = tx, sy = ty;

					ans++;

					flag = false;

					return;

				}else if(tx >= 0 && tx < h && ty >= 0 && ty < w && vis[tx][ty] == 0 &&  mp[tx][ty] != 'X'){

//					cout<<"tx = "<<tx<<", ty = "<<ty<<endl;

					que.push(Node(tx, ty));

					vis[tx][ty] = 1;

				}

			} 

		}

		ans++;

	}

	if(flag) ans = 0;

}



int main(){

	cin>>h>>w>>n;

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

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

	}

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

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

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

				sx = i, sy = j;

			}

		}

	}

	int res = 0;

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

		bfs(i + '0');

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

			for(int k = 0; k < w; k++)

				vis[m][k] = 0;

		while(!que.empty())que.pop();

		res += ans;

	}

	cout<<res<<endl;

	return 0;

}



/**

331

S..

...

..1

*/