// Slower C++ solution:
//

// Create by 神舟 on 2015-02-21

//



#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <cstdlib>

#include <algorithm>

#include <cctype>

#include <stack>

#include <queue>

#include <map>

#include <string>

#include <set>

#include <vector>

using namespace std;



#define CLR(x) memset(x,0,sizeof x)

#define ll long long

#define inf 0x3f3f3f3f

const int maxn=1e3+5;

const int MOD=5e5+5;

int n,m,t,sx,sy,ex,ey;

char word[maxn][maxn];

int path[maxn][maxn];

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



struct pnt

{

    int x,y;

    pnt(int x=0,int y=0):x(x),y(y){};

};



void bfs()

{

    memset(path,0x3f,sizeof path);

    queue <pnt> que;

    pnt p,np;

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

    path[sx][sy]=0;

    que.push(p);

    while(!que.empty()){

        p=que.front();que.pop();

        if(p.x==ex&&p.y==ey) {return;}

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

            np.x=p.x+dir[i][0];

            np.y=p.y+dir[i][1];

            if(np.x>0 && np.x<=n && np.y>0 && np.y<=m && path[np.x][np.y]>path[p.x][p.y]+1 && word[np.x][np.y]!='X')

            {

                path[np.x][np.y]=path[p.x][p.y]+1;

                que.push(np);

            }

        }

    }

}

int main()

{

#ifdef LOCAL

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

	//freopen("out.txt","w",stdout);

#endif

	ios_base::sync_with_stdio(0);



	while(scanf("%d%d%d",&n,&m,&t)!=EOF){

        ans=0;

        CLR(word);

        for(int i=1;i<=n;scanf("%s",word[i++]+1));

        for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(word[i][j]=='S') word[i][j]='0';

        for(int k=0;k<t;k++){

            char tp=k+'0';

            for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){

                if(word[i][j]==tp) sx=i,sy=j;

                if(word[i][j]==tp+1) ex=i,ey=j;

            }

            bfs();

            ans+=path[ex][ey];

            //printf("%d\t",path[ex][ey]);

        }

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

	}



	return 0;

}

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

#include<queue>

#include<cstdio>

using namespace std;

const int INF=1000000;

int d[1005][1005];

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

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

char s[1005][1005];

int m,n,k;

//int sx,sy,gx,gy;

typedef pair <int,int >P;

P aim[15];

int isd(char ch)

{

    return ch>='0'&&ch<='9'?1:0;

}

int bfs(int sx,int sy,int gx,int gy)

{

    queue<P> que;

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

    {

        for(int j=0; j<n; j++)

        {

            d[i][j]=INF;

//            cout <<d[i][j]<<endl;

        }

    }

    que.push(P(sx,sy));

    d[sx][sy]=0;

    while(que.size())

    {



        P p=que.front();

        que.pop();

        if(p.first==gx&&p.second==gy)

        {

            break;

        }

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

        {

            int nx=p.first+dx[i];

            int ny=p.second+dy[i];

//            cout << nx << ":" << ny << endl;

//            cout << que.size()<<" "<<m<<" "<<n<<endl;

            if( nx>=0&&nx<m

                    &&ny>=0&&ny<n

                    &&s[nx][ny]!='X'

                    &&d[nx][ny]==INF)

            {



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



                d[nx][ny]=d[p.first][p.second]+1;

            }

        }

    }

    return d[gx][gy];

}

int main()

{

    cin >> m >> n >> k;

    int sum = 0;

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

    {

        for(int j=0; j<n; j++)

        {

            cin >> s[i][j];

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

            {

                aim[0].first=i;

                aim[0].second=j;

//                cout << i <<" "<< j <<endl;

            }

            if(isd(s[i][j]))

            {

                aim[s[i][j]-'0'].first=i;

                aim[s[i][j]-'0'].second=j;

//                cout << i << " "<<j <<endl;

            }



        }





    }

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

    {

        int steep=bfs(aim[i].first,aim[i].second,aim[i+1].first,aim[i+1].second);

        sum+=steep;

//            cout << steep <<endl;

    }

    cout << sum <<endl ;

}