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

#include <cstdio>

#include <cstdlib>

#include <queue>

using namespace std;



const int N = 1000;

const int INF = 0x3f3f3f3f;



int n, m, f;

char map[N][N+1];



bool legal(int x, int y, int k)

{

    return x >= 0 && x < n && y >= 0 && y < m

        && map[x][y] != 'X';

}



void input()

{

    cin >> n >> m >> f;

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

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

    }

}



int BFS(int k)

{

    int i, j;

    int d[N][N];

    typedef pair<int, int> P;

    queue <P> q;

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

        for (j = 0; j < m; j ++) {

            d[i][j] = INF;

            if ((k == 0 && map[i][j] == 'S') || map[i][j] == '0'+k) {

                q.push(P(i, j));

                d[i][j] = 0;

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

            }

        }

    }



    while( q.size() ) {

        P p = q.front();

        q.pop();

        int x = p.first;

        int y = p.second;



        if (map[x][y] == INF)

            return d[x][y];



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

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

            int nx = x + pos[i][0];

            int ny = y + pos[i][1];

            if (legal(nx, ny, k) && d[nx][ny] == INF) {

                q.push(P(nx, ny));

                d[nx][ny] = d[x][y]+1;

                if (map[nx][ny] == '0'+k+1) {

                    return d[nx][ny];

                }

            }

        }

    }



    return INF;

}



void solve()

{

    int res = 0;

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

        res += BFS(i);

    }

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

}



int main(void)

{

    input();



    solve();



    return 0;

}

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

            }

        }

    }

}