// 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.6144903732223237x):
#include<queue>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;



#define MAXN 1000

struct node{

    int x,y,st;

    bool operator == (node B) const{

        return x==B.x&&y==B.y;

    }

};

int H,W,N;

char Map[MAXN+5][MAXN+5];

bool vis[MAXN+5][MAXN+5];



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

int bfs(node S,node T){

    queue<node> Q;

    Q.push(S);

    memset(vis,0,sizeof vis);

    while(!Q.empty()){

        node u=Q.front();Q.pop();

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

            node tmp=u;

            tmp.x+=dir[i][0],tmp.y+=dir[i][1],tmp.st++;

            if(tmp.x<1||tmp.x>H||tmp.y<1||tmp.y>W||vis[tmp.x][tmp.y]||Map[tmp.x][tmp.y]=='X')

                continue;

            if(tmp==T)

                return tmp.st;

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

            Q.push(tmp);

        }

    }

    return -1;

}



pair<int,int> pos[10];



int main(){

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

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

        scanf("%s",Map[i]+1);

    node S;

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

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

            if(Map[i][j]!='.'&&Map[i][j]!='X'&&Map[i][j]!='S')

                pos[Map[i][j]-'1'+1]=make_pair(i,j);

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

                S.x=i,S.y=j,S.st=0;

        }

    int Ans=0;

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

        Ans+=bfs(S,(node){pos[i].first,pos[i].second,0});

        S=(node){pos[i].first,pos[i].second,0};

    }

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

}