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

#include <cstring>

#include <cstdio>

#include <algorithm>

#include <vector>

#include <queue>



using namespace std;

struct as

{

    int x,y;

}pos[10]; //用来存储每次的起点和终点

struct node

{

    int x,y;

    int step;

};

bool vis[1010][1010];

char maze[1050][1050];

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

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

int H,W,N;



bool check(int x,int y)

{

    if (x<=0 || x>H) return 1;

    if (y<=0 || y>W) return 1;

    if (vis[x][y]) return 1;

    if (maze[x][y] =='X')return 1;

    return 0;

}

int bfs(int m,int n)

{

    memset(vis,0,sizeof vis);

    int sx = pos[m].x, sy = pos[m].y;

    int gx = pos[n].x, gy = pos[n].y;

   // printf("%d %d\n",sx,sy);

   // printf("%d %d\n",gx,gy);

    queue<node> Q;

    node a,next;

    a.step = 0;

    a.x = sx, a.y =sy;

    Q.push(a);

    while(!Q.empty())

    {

        a = Q.front();

        Q.pop();

        if (a.x == gx && a.y == gy)

            return a.step;

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

        {

            int nx = a.x + dx[i];

            int ny = a.y + dy[i];

            if(check(nx,ny))

                continue;

            else

            {

                vis[nx][ny] =1;

                next.x = nx,next.y = ny,next.step = a.step+1;

                Q.push(next);

            }

        }

    }

    return 999999;

}



int main()

{

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

    while(cin>>H>>W>>N)

    {

        int sx,sy;

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

        {

            for(int j = 1; j <= W;j++)

            {

                cin>>maze[i][j];

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

                {

                    pos[maze[i][j]-'0'].x = i;

                    pos[maze[i][j]-'0'].y = j;

                }

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

                    sx=i,sy = j;

            }

        }



        pos[0].x = sx,pos[0].y = sy;

        int ans = 0;

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

            ans += bfs(i,i+1);

        cout<<ans<<endl;

    }

    return 0;

}




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

#include <queue>

#include <string>

#include <cstdio>

#include <cstring>

#include <utility>

using namespace std;

typedef pair<int, int> P;

char maze[1005][1005];

int d[1005][1005];

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

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

int h, w, n, hard; 

int si, sj;

const int INF = 0x3f3f3f3f;

int tot = 0; 



void BFS(int ai, int aj){

    queue<P> que;

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

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

            d[i][j] = INF;

        }

    }

    que.push(P(ai, aj));

    d[ai][aj] = 0;

    while(!que.empty()){

        P a = que.front();

        que.pop();

        int x = a.first, y = a.second;

        if(maze[x][y]-'0' == hard){

            tot += d[x][y];

            si = x; sj = y;

            break;

        }

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

            int dx = x+dirx[i], dy = y+diry[i];

            if(dx>=0 && dx<h && dy>=0 && dy<w && maze[dx][dy]!='X' && d[dx][dy]==INF){

                d[dx][dy] = d[x][y]+1;

                que.push(P(dx, dy));

            }

        }

    }

}



int main(int argc, char const *argv[]){

    while(scanf("%d%d%d", &h, &w, &n) != EOF){

        getchar();

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

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

                scanf("%c", &maze[i][j]);

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

                    si = i; sj = j;

                }

            }

            getchar();

        }

        tot = 0;

        hard = 1;

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

            BFS(si, sj);

            hard++;

        }

        cout << tot << endl;

    }

    return 0;

}