// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<iostream>

#include<queue>

#include<vector>

#include<algorithm>

#include<string>

#include<cmath>

#include<set>

#include<map>

#include<vector>

#include<stack>

#include<utility>

#include<sstream>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int maxn = 1005;

int a[1005][1005];

int x[20], y[20];

int ans, w, h, n;

bool leap[1005][1005];

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

struct Node

{

	int x, y, t;

	Node(int x, int y, int t) :x(x), y(y), t(t){}

};

int work(int xx, int yy, int pos)

{

	memset(leap, false, sizeof(leap));

	leap[xx][yy] = 1;

	queue<Node>p;

	p.push(Node(xx, yy, 0));

	while (p.size())

	{

		Node temp = p.front();

		p.pop();

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

		{

			int tempx = temp.x + dir[i][0];

			int tempy = temp.y + dir[i][1];

			if (tempx >= 1 && tempx <= h&&tempy >= 1 && tempy <= w)

			{

				if (a[tempx][tempy] == 1)continue;

				if (leap[tempx][tempy] == 1)continue;

				if (tempx == x[pos + 1] && tempy == y[pos + 1])

				{

					return temp.t + 1;

				}

				leap[tempx][tempy] = 1;

				p.push(Node(tempx, tempy, temp.t + 1));

			}

		}

	}



}

int main()

{

#ifdef LOCAL

	freopen("C:\\Users\\ΡΡ\\Desktop\\in.txt", "r", stdin);

	//freopen("C:\\Users\\ΡΡ\\Desktop\\out.txt","w",stdout);

#endif // LOCAL

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

	{

		char s[1005];

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

		{

			scanf("%s", s);

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

			{

				if (s[j - 1] == '.')

					a[i][j] = 0;

				else if (s[j - 1] == 'X')

					a[i][j] = 1;

				else if (s[j - 1] == 'S')

				{

					x[0] = i; y[0] = j;

					a[i][j] = 0;

				}

				else

				{

					a[i][j] = 0;

					int id = s[j - 1] - '0';

					x[id] = i; y[id] = j;

				}

			}

		}

		ans = 0;

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

		{

			ans = ans + work(x[i], y[i], i);

		}

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

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.016150377461947x):
#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;

 }