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

#include<cstdio>

#include<queue>

#include<utility>

#include<cstring>

using namespace std;

char map[1005][1005];

bool vis[1005][1005];

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

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

int sx,sy;

int h,w;

int bfs(int n){

	memset(vis,false,sizeof(vis));

	queue<pair<pair<int,int>,int> >que;

	que.push(make_pair(make_pair(sx,sy),0));

	while(!que.empty()){

		pair<int,int>now=que.front().first;

		int cnt=que.front().second;

		que.pop();

		if(map[now.first][now.second]==n+48){

			sx=now.first;

			sy=now.second;

			return cnt;

		}

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

			int _x=now.first+dx[i];

			int _y=now.second+dy[i];

			if(_x<0||_y<0||_x>=h||_y>=w||map[_x][_y]=='X'||vis[_x][_y]){

				continue;

			}

			vis[_x][_y]=true;

			que.push(make_pair(make_pair(_x,_y),cnt+1));

		}

	}

}

int main(){

	int n;

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

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

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

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

		}

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

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

				if(map[i][j]=='S'){

					sx=i;

					sy=j;

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

					break;

				}

			}

		}

		int count=0;

		for(int k=1;k<=n;k++){

			count+=bfs(k);

		}

		cout<<count<<endl;

	}

	return 0;

}

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

            }

        }

    }

}