// Slower C++ solution:
//

//  AOJ 0558 Chees

//

//  Created by TaoSama on 2015-02-20

//  Copyright (c) 2014 TaoSama. All rights reserved.

//

#include <algorithm>

#include <cctype>

#include <cmath>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iomanip>

#include <iostream>

#include <map>

#include <queue>

#include <string>

#include <set>

#include <vector>

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



using namespace std;

const int INF = 0x3f3f3f3f;

const int MOD = 1e9 + 7;

const int N = 1e5 + 10;



struct Point {

	int x, y;

	Point(int x = 0, int y = 0): x(x), y(y) {}

} c[15];

int n, m, k, dp[1005][1005];

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

char a[1005][1005];



int bfs(int x) {

	memset(dp, 0x3f, sizeof dp);

	queue <Point> q; q.push(c[x - 1]);

	dp[c[x - 1].x][c[x - 1].y] = 0;

	while(!q.empty()) {

		Point cur = q.front(); q.pop();

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

			Point nxt(cur.x + d[i][0], cur.y + d[i][1]);

			if(nxt.x < 1 || nxt.x > n || nxt.y < 1 || nxt.y > m

			        || a[nxt.x][nxt.y] == 'X') continue;

			if(dp[nxt.x][nxt.y] == INF) {

				dp[nxt.x][nxt.y] = dp[cur.x][cur.y] + 1;

				q.push(nxt);

			}

		}

	}

	return dp[c[x].x][c[x].y];

}

int main() {

#ifdef LOCAL

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

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

#endif

	ios_base::sync_with_stdio(0);



	while(cin >> n >> m >> k) {

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

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

				cin >> a[i][j];

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

					c[0].x = i, c[0].y = j;

				if(isdigit(a[i][j]))

					c[a[i][j] - '0'].x = i, c[a[i][j] - '0'].y = j;

			}

		}

		int ans = 0;

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

			ans += bfs(i);

		cout << ans << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.093415198060179x):
#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 ;

}