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

using namespace std;



#define PS push

#define PB push_back

#define MP make_pair

#define fi first

#define se second

const int INF = 0x3f3f3f3f;

#define cer(x) cout<<#x<<'='<<endl

#define REP0(i,n) for(int i = 0; i < n; i++)

#define REP1(i,n) for(int i = 1; i <= n; i++)

#define DWN(i,n) for(int i = n; i > 0; i--)

#define DWN_(i,n) for(int i = n; i >= 0; i--)

#define REP(i,s,e) for(int i = s; i < e; i++)

#define REP_(i,s,e) for(int i = s; i <= e; i++)

#define CLR(a,v) memset(a,v,sizeof(a))

typedef long long ll;



inline int read()

{

    int ret; char c; while(c = getchar(),c<'0'||c>'9');

    ret = c-'0';

    while(c = getchar(),c>='0'&&c<='9') ret = ret*10 + c-'0';

    return ret;

}



inline int reads()

{

    int ret; char c; while(c = getchar(),c != '-' && (c<'0'||c>'9'));

    bool Sign = c == '-';

    ret = Sign?0:c-'0';

    while(c = getchar(),c>='0'&&c<='9') ret = ret*10 + c-'0';

    return Sign?-ret:ret;

}



const int SZ = 1e3+5;



char g[SZ][SZ];

int H,W,N;

int vis[SZ][SZ],clk;

struct Node

{

    int x,y,f,h;

    bool operator <(const Node&th) const {

        return f > th.f || ( f == th.f && h > th.h);

    }

}pos[10];



int tar;

inline int MHT(Node &o)

{

    return (abs(pos[tar].x-o.x) + abs(pos[tar].y-o.y))>>1;

}



void GetPos()

{

    REP0(i,H){

        REP0(j,W){

            char c = g[i][j];

            if(c == 'S'){

                pos[0] = {i,j};

            }else if('1'<= c && c <='9' ){

                pos[c-'0'] = {i,j};

            }

        }

    }

}



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

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



inline bool valid(int x,int y)

{

    return x>=0&&x<H&&y>=0&&y<W&&g[x][y]!='X'&&vis[x][y] != clk;

}



int astar_bfs(int st)

{

    priority_queue<Node> q;

    Node u;

    u.x = pos[st].x;

    u.y = pos[st].y;

    u.h = u.f = MHT(u);

    q.push(u);

    clk++;

    while(q.size()){

        u = q.top(); q.pop();

        if(u.x == pos[tar].x && u.y == pos[tar].y ) return u.f-u.h;

        REP0(k,4){

            Node v;

            v.x = u.x + dx[k];

            v.y = u.y + dy[k];

            if(!valid(v.x,v.y)) continue;

            vis[v.x][v.y] = clk;

            v.h = MHT(v);

            v.f = u.f-u.h+1+v.h;

            q.push(v);

        }

    }

    return -1;

}



int main()

{

#ifdef LOCAL

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

#endif

    H = read(); W = read(); N = read();

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

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

    }

    GetPos();

    int ans = 0;

    REP1(i,N){

        tar = i;

        ans += astar_bfs(i-1);

    }

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

    return 0;

}