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

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define SC(x) scanf("%d",&x);

#define pr(x)  cout << x << endl;

#define mem(arr,v) memset(arr,v,sizeof arr);

#define bug(x) cout << "#x = " << x <<endl;

const int inf = 0x3f3f3f3f;

const int maxn = 1010;

typedef long long ll;

using namespace std;

char Mz[maxn][maxn],c;

bool vis[maxn][maxn];

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

int M,N,C;

int px[10],py[10];

struct node {

	int x,y,step;

};



int bfs(int des,int sx,int sy) {

	mem(vis,0);

	vis[sx][sy] = 1;

	node nod = {sx,sy,0};

	queue<node> q;

	q.push(nod);



	while(!q.empty()) {

		nod =  q.front();

		q.pop();

		

		int x = nod.x, y = nod.y;

		int step =  nod.step;

		

		if(Mz[x][y] == des + '0')

			return step;

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

			int dx = x + dir[i][0];

			int dy = y + dir[i][1];

			if(Mz[dx][dy] == 'X' || Mz[dx][dy] == -1 || vis[dx][dy])	continue;

			nod = {dx,dy,step + 1};

			q.push(nod);

			vis[dx][dy] = 1;

		}

	}

}



int main() {

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

	cin >> N >> M >> C;

	mem(Mz,-1)

	mem(px,0)  mem(py,0)



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

		for(int j = 1; j <= M ; j++) {

			cin >> c;

			Mz[i][j] = c;

			if(c == '.' || c == 'X')	continue;

			if(c == 'S') px[0] = i, py[0] = j;

			else

				px[c - '0'] = i , py[c - '0'] = j;

		}

	int res = 0;

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

		if(px[i] && py[i]) {

//				dfs(i + 1,px[i],py[i],0);

			res += bfs(i + 1,px[i],py[i]);

		}

	}

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

}

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

#include <cstring>

#include <queue>

#include <cctype>



using namespace std;



struct State {

    int step;

    int x;

    int y;



    State() {

        step = 0;

        x = 0;

        y = 0;

    }



    State(int step, int x, int y): step(step), x(x), y(y) {}

};



const int MAX_N = 1000;

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

char board[MAX_N][MAX_N];

int W, H, N;

State pos[10];



void init();

void input();

void solve();

int bfs(State from, State to);

void findPossition();



int main() {

#ifdef LOCAL

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

    freopen("data.out", "w", stdout);

#endif

    init();

    input();

    solve();

    return 0;

}



void init() {

}



void input() {

    scanf("%d %d %d", &H, &W, &N);



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

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

    }

}





void solve() {

    int moves = 0;

    findPossition();



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

        moves += bfs(pos[i], pos[i + 1]);

    }



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

}



int bfs(State from, State to) {

    queue<State> que;

    bool visit[H][W];

    State cur = from;



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

        memset(visit[i], false, sizeof(visit[i]));

    }



    que.push(cur);



    while(!que.empty()) {

        cur = que.front();

        que.pop();



        if(visit[cur.x][cur.y]) {

            continue;

        }

        

        visit[cur.x][cur.y] = true;



        if(cur.x == to.x && cur.y == to.y) {

            break;

        }



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

            int x = cur.x + dir[i][0];

            int y = cur.y + dir[i][1];



            if(x < 0 || x >= H || y < 0 || y >= W || visit[x][y] || 'X' == board[x][y]) {

                continue;

            }



            que.push(State(cur.step + 1, x, y));

        }

    }



    return cur.step;

}



void findPossition() {

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

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

            int c = board[i][j];



            if('S' == c) {

                pos[0] = State(0, i, j);

            }



            if(isdigit(c)) {

                pos[c - '0'] = State(0, i, j);

            }

        }

    }

}