// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<queue>



using namespace std;



struct node

{

    int s;

    int x,y;

};



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

int vis[1010][1010];

int n,m,k,sx[20],sy[20];

char mp[1010][1010];



int bfs(int x,int y,int ex,int ey)

{

    queue<node> q;

    node a,b,d;

    a.x = x;

    a.y = y;

    a.s = 0;

    vis[x][y] = 1;

    q.push(a);

    while(!q.empty())

    {

        b = q.front();

        q.pop();

        if(b.x == ex && b.y == ey)

        {

            return b.s;

        }

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

        {

            d.x = b.x + dir[i][0];

            d.y = b.y + dir[i][1];

            if(d.x >= 0 && d.x < n && d.y >= 0 && d.y < m && vis[d.x][d.y] == 0)

            {

                if(mp[d.x][d.y] >= '1' && mp[d.x][d.y] <= '9' || mp[d.x][d.y] == '.')

                {

                    vis[d.x][d.y] = 1;

                    d.s = b.s + 1;

                    q.push(d);

                }

            }

        }

    }

}



int main()

{

    while(~scanf("%d%d%d",&n,&m,&k))

    {

        int i,j,t;



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

        {

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

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

                if(mp[i][j] == 'S')

                {

                    sx[0] = i;

                    sy[0] = j;

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

                }

        }

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

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

                if(mp[i][j] >= '1' && mp[i][j] <= '9')

                {

                    sx[mp[i][j]-'0'] = i;

                    sy[mp[i][j]-'0'] = j;

                }

        int ans = 0;

        for(i = 1; i <= k; i++)

        {

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

            ans += bfs(sx[i-1],sy[i-1],sx[i],sy[i]);

        }

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

    }

    return 0;

}

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

#include <stdlib.h>

#include <queue>

#include <cstring>

#define MAX_NUM 1010

using namespace std;

int H, W, N;

bool flag[MAX_NUM][MAX_NUM] = {false};                            //??是否已遍??

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



class Node {

  public:

    Node();

    Node(int x, int y, int step);

    ~Node();

    int x;

    int y;

    int step;

};



Node::Node() {

}



Node::Node(int x, int y, int step) {

    this->x = x;

    this->y = y;

    this->step = step;

}



Node::~Node() {

}



int BFS(char map[][MAX_NUM], int sx, int sy, int ex, int ey) {

    queue<Node> que;                                                  //第一次出?Memory Limit Exceeded,一定不能使用new来?行?建

    Node node(sx, sy, 0);

    que.push(node);

    flag[sx][sy] = true;                                              //将遍?的?点?置?true



    while(!que.empty()) {

        Node cur = que.front();

        que.pop();



        if(cur.x == ex && cur.y == ey) {

            return cur.step;



        } else {

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

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

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



                if(k >= 0 && k < H && v >= 0 && v < W && map[k][v] != 'X' && !flag[k][v]) { //将可到?并且尚未遍?的?点加入?列

                    Node temp(k, v, cur.step + 1);

                    que.push(temp);

                    flag[k][v] = true;

                }

            }

        }

    }



    return -1;

}



int main() {

    int sx, sy, arr[10][2];

    char map[MAX_NUM][MAX_NUM];



    if(cin >> H >> W >> N && H && W) {

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

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

                cin >> map[i][j];



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

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

                    sx = i;

                    sy = j;

                }



                if(isdigit(map[i][j])) {

                    int index = map[i][j] - '0';

                    arr[index][0] = i;

                    arr[index][1] = j;

                }

            }

        }



        arr[0][0] = sx;

        arr[0][1] = sy;

        int res = 0;



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

            memset(flag, false, sizeof(flag));

            res += BFS(map, arr[i][0], arr[i][1], arr[i + 1][0], arr[i + 1][1]);

        }



        cout << res << endl;

    }



    return 0;

}