// 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: 1.9892198338945128x):
#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;

}