// Slower C++ solution:
/************************************************

* Author        :somniloquy

* Created Time  :2015/10/30 16:15:09

 ************************************************/



#include <cstdio>

#include <algorithm>

#include <iostream>

#include <cstring>

#include <queue>



using namespace std;



const int hw_max = 1000 + 5;

char graph[hw_max][hw_max];

int sign[hw_max][hw_max];

int h, w, n, ans;

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

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

struct node

{

	int x;

	int y;

	int time;

} start;



void BFS(node op, char ed)

{

	queue <node> process;

	process.push(op);

	sign[op.x][op.y] = 1;

	while(!process.empty())

	{

		node now = process.front();

		process.pop();

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

		{

			node next = now;

			next.x += dx[i];

			next.y += dy[i];

			next.time ++;

			if(next.x >= 0 && next.x < h && next.y >= 0 && next.y < w && graph[next.x][next.y] != 'X' && !sign[next.x][next.y])

			{

				if(graph[next.x][next.y] == ed)

				{

					ans += next.time;

					next.time = 0;

					start = next;

				       	return;

				}

				else

				{

					process.push(next);

					sign[next.x][next.y] = 1;

				}

			}

		}

	}

}



int main()

{

	while(~scanf("%d %d %d", & h, & w, & n))

	{

		getchar();

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

		{

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

			{

			       scanf("%c", & graph[i][j]);

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

			       {

					start.x = i;

					start.y = j;

					start.time = 0;

			       }

			}

			getchar();

		}

		ans = 0;

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

		{

			memset(sign, 0, sizeof(sign));

			BFS(start, '0' + i);

		}

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

	}

	return 0;

}

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

#include<queue>

#include<cstdio>

#include<cstring>

#include<utility>

using namespace std;

struct dir

{

	int x,y;

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

char hole[1005][1005];

int d[1005][1005],h,w,factory[10][2];

typedef pair<int,int> P;

int bfs(const int &sx,const int &sy,const int &gx,const int &gy)

{

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

	{

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

		{

			d[i][j] = -1;

		}

	}

	//memset(d,-1,sizeof(d));

	queue<P> que;

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

	d[sx][sy]=0;

	while(que.size())

	{

		P p=que.front();

		que.pop();	

		if(p.first==gx&&p.second==gy)

		break;

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

		{

		int nx=p.first+dir[i].x;

		int ny=p.second+dir[i].y;

		if(nx>=0&&ny>=0&&nx<h&&ny<w&&hole[nx][ny]!='X'&&d[nx][ny]==-1)

		{

			d[nx][ny]=d[p.first][p.second]+1;

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

		}

		}

	}

	return d[gx][gy];

}

int main()

{

	int sx,sy,i,j,step=0,n;

	scanf("%d%d%d\n",&h,&w,&n);

	//cin>>h>>w>>n;

	for(i=0;i<h;i++,getchar())

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

		{

			scanf("%c",&hole[i][j]);

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

			{

				factory[0][0]=i;

				factory[0][1]=j;

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

			}

			if(isdigit(hole[i][j]))

			{

				int index=hole[i][j]-'0';

			factory[index][0]=i;

			factory[index][1]=j;

			}

		}

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

	step+=bfs(factory[i][0],factory[i][1],factory[i+1][0],factory[i+1][1]);

	//cout<<step<<endl;

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

	return 0;

 }