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

#include <cmath>

#include <queue>

#include <cstdio>

#include <cstring>

#include <algorithm>



#define INF 0x7f7f7f7f

#define PI acos(-1.0)



#define L(x)    (x) << 1

#define R(x)    (x) << 1 | 1

#define lowbit(x)   (x)&(-x)

#define Mid(l, r)   (l + r) >> 1

#define Min(x, y)   (x) < (y) ? (x) : (y)

#define Max(x, y)   (x) < (y) ? (y) : (x)

#define iabs(x)     (x) < 0 ? -(x) : (x)

#define CLR(arr, val)    memset(arr, val, sizeof(arr))



using namespace std;



char map[1024][1024];

bool vis[1024][1024];

int cur, h, w;

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



struct node {

	int x, y, step;

} sta, now;



bool check(int x, int y) {

	if (x >= 0 && x < h && y >= 0 && y < w && !vis[x][y] && map[x][y] != 'X')	return true;

	return false;

}







void bfs(node s) {

	memset(vis, 0, sizeof(vis));



	queue<node> que;

	s.step = 0;

	que.push(s);

	node next;

	while (!que.empty()) {

//		cout << "h\n";

		s = que.front();

//		cout << s.x << ' ' << s.y << ' ' << cur << endl;

		que.pop();

		if (map[s.x][s.y] == cur + '0')	{

			sta = s;

			return ;

//			s.step;

		}



//		cout << "a\n";

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

//			cout << i << endl;

			next.x = s.x + dir[i][0];

			next.y = s.y + dir[i][1];

			next.step = s.step + 1;

			if (check(next.x, next.y)) {

				vis[next.x][next.y] = true;

				que.push(next);

			}



		}

	}

}



int main() {

	int n;

	while (cin >> h >> w >> n) {

//		memset(map, 0, sizeof(map));

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

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

				cin >> map[i][j];

				if (map[i][j] == 'S')	sta.x = i, sta.y = j, map[i][j] = '.';

			}

		}

		sta.step = 0;

		int ans = 0;

		for (cur = 1; cur <= n; cur++) {

			bfs(sta);

			ans += sta.step;

			//cout << ans << endl;

		}

		cout << ans << endl;

	}

	return 0;

}

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

}