// 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.132949206469201x):
#include<iostream>

#include<iomanip>

#include<cstdlib>

#include<math.h>

#include<algorithm>

#include<string>

#include<vector>

#include<list>

#include<queue>

#include<stack>

#include<deque>

#include<set>

#include<map>

#define REP(i, N) for(ll i = 0; i < N; ++i)

#define FOR(i, a, b) for(ll i = a; i < b; ++i)

#define ALL(a) (a).begin(),(a).end()

#define pb push_back

#define INF 1000000000

#define MOD 1000000007

using namespace std;

typedef long long ll;

typedef pair<ll, ll> P;

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

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

int qx[8] = {1, 1, 0, -1, -1, -1, 0, 1};

int qy[8] = {0, 1, 1, 1, 0, -1, -1, -1};



int main(void) {

	ll h, w, n;

	cin>>h>>w>>n;

	vector<string> a(h);

	vector<vector<ll> > dist(h, vector<ll>(w, INF));

	ll time = 0;

	P sp;

	REP(i, h) cin>>a[i];

	bool det = false;

	REP(i, h) {

		REP(j, w) {

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

				sp.first = i;

				sp.second = j;

				det = true;

				break;

			}

		}

		if(det) break;

	}

	REP(i, n) {

		queue<P> c;

		c.push(sp);

		dist[sp.first][sp.second] = 0;

		while(true) {

			P cp = c.front();

			c.pop();

			if(a[cp.first][cp.second] - '1' == i) {

				time += dist[cp.first][cp.second];

				sp = cp;

				break;

			}

			REP(j, 4) {

				ll nx = cp.first + dx[j];

				ll ny = cp.second + dy[j];

				if(nx >= 0 && nx < h && ny >= 0 && ny < w && dist[nx][ny] == INF && (a[nx][ny] == 'S' || a[nx][ny] == '.' || (a[nx][ny] >= '1' && a[nx][ny] <= '9'))) {

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

					dist[nx][ny] = dist[cp.first][cp.second] + 1;

				}

			}

		}

		REP(j, h) {

			REP(k, w) {

				dist[j][k] = INF;

			}

		}

	}

	cout<<time<<endl;

}