// Slower C++ solution:
#include"stdio.h"

#include"stdlib.h"

#include"string.h"

#include"algorithm"

#include"queue"

using namespace std;

struct mmm

{

	int x,y;

}vv;

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

char xx[1005][1005];

int bb[11][2];

queue <mmm> qq;

int vis[1005][1005];

int bfs(char t)

{

	int sum = 0;

	int pl = 0;

	while(!qq.empty())

	{

		vv = qq.front();

		int x0 = vv.x;

		int y0 = vv.y;

		//printf("%d %d %d\n",x0,y0,vis[x0][y0]);

		qq.pop();

		if(xx[x0][y0] == t && !pl)

		{

			sum = vis[x0][y0];

			pl = 1;

		}

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

		{

			int xt = x0 + dir[i][0];

			int yt = y0 + dir[i][1];

			if(xx[xt][yt] != '#' && xx[xt][yt] != 'X' && vis[xt][yt] == -1)

			{

				vis[xt][yt] = vis[x0][y0] + 1;

				vv.x = xt;

				vv.y = yt;

				qq.push(vv);

			}

		}

	}

	return sum;

}

int main()

{

	int a,b,c,d,x1,y1,sum;

	while(~scanf("%d %d %d",&a,&b,&c))

	{

	//	if(a == 0 && b == 0)

	//	break;

		memset(xx,'#',sizeof(xx));

		getchar();

		for(int i = 1;i <= a;i++)

		{

			for(int j = 1;j <= b;j++)

			{

				xx[i][j] = getchar();

				if(xx[i][j] == 'S')

				{

					x1 = i;

					y1 = j;

				}

				else if(xx[i][j] != 'X')

				{

					bb[xx[i][j] - '0'][0] = i;

					bb[xx[i][j] - '0'][1] = j;

				}

			}

			getchar();

		}

		bb[0][0] = x1;

		bb[0][1] = y1;

		sum = 0;

		for(int i = 1;i <= c;i++)

		{

			vv.x = bb[i-1][0];

			vv.y = bb[i-1][1];

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

			vis[vv.x][vv.y] = 0;

			qq.push(vv);

			sum += bfs(i + '0');

		}

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

	}

	return 0;

}

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

#include<iostream>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<algorithm>

#include<string>

#include<cstring>

#include<cstdlib>

#include<cctype>

#include<sstream>

#include<stack>

#include<functional>

using namespace std;

typedef long long ll;

typedef pair<int, int> P;

const int INF=0x3f3f3f3f;

const int MAX_N = 10;

const int MAX_H = 1005;

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

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

struct T{

    int x,y;

};//坐?

char G[MAX_H][MAX_H];

T aim[MAX_N];

int vis[MAX_H][MAX_H]; // ???数

int H, W, N;

T s, t; //起点，?点



int bfs(){

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

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

            vis[i][j] = -1;

    queue<T> q;

    q.push(s);

    vis[s.x][s.y] = 0;

    while(!q.empty()){

        T cur = q.front();

        q.pop();

        if(cur.x == t.x && cur.y == t.y)break;

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

            T nxt;

            nxt.x = cur.x + dx[i];

            nxt.y = cur.y + dy[i];

            if(nxt.x >= 0 && nxt.x < H && nxt.y >= 0 && nxt.y < W && vis[nxt.x][nxt.y] == -1 && G[nxt.x][nxt.y] != 'X'){

                q.push(nxt);

                vis[nxt.x][nxt.y] = vis[cur.x][cur.y] + 1;

            }

        }

    }

    return vis[t.x][t.y];

}



void solve(){

    int ans = 0;

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

        t = aim[i]; //?个?酪??点

        ans += bfs();

        s = t; //?次?点??下次起点

        G[s.x][s.y] = '.';

	}

	cout << ans << endl;

}

int main()

{

	#ifdef LOCAL

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

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

	#endif

	//ios::sync_with_stdio(false);

	cin >> H >> W >> N;

	int p = 0;

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

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

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

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

                s.x = i;s.y =j;

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

            }

            else if(G[i][j] <= '9' && G[i][j] >= 0){

                int num = G[i][j] - '0' - 1;

                aim[num].x = i;aim[num].y = j;

            }

        }

	}

	solve();

	return 0;

}