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

#include<algorithm>

#include<cstdio>

#include<cstring>

#include<string>

#include<cstdlib>

#include<stack>

#include<queue>

#include <map>

#include<cmath>

#include<vector>

#define MAX_N 1000000

#define INF 0x3f3f3f3f

#define SIZE 1000

using namespace std;







struct note

{

    int x, y;

}start, ende;

typedef pair<int, int> P;

int H, W, N;

char a[1003][1003];

int sum;

int d[1003][1003];

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

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

void bfs(note h, note m)

{

    memset(d, -1, sizeof(d));

    queue<P> que;

    que.push(P(h.x, h.y));

    d[h.x][h.y] = 0;

    while (!que.empty())

    {

        P p = que.front();

        que.pop();

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

        {

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

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

            if (xx >= 0 && xx < H && yy >= 0 && yy < W && a[xx][yy] != 'X' && d[xx][yy] == -1)

            {

                d[xx][yy] = d[p.first][p.second] + 1;

                que.push(P(xx, yy));

            }

        }

    }

    sum += d[m.x][m.y];

    start = ende;

}

void solve()

{

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

    {

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

        {

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

            {

                start.x = i;

                start.y = j;

                i = H;

                j = W;

            }

        }

    }

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

    {

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

        {

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

            {

                if (a[i][j] == k + 49)

                {

                    ende.x = i;

                    ende.y = j;

                    bfs(start, ende);

                    i = H;

                    j = W;

                }

            }

        }

    }

    cout << sum << endl;

}

int main()

{

    cin >> H >> W >> N;

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

    {

        cin >> a[i];

    }

    sum = 0;

    solve();

    return 0;

}

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

#include <queue>

#include <string>



using namespace std;



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

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

int First = 1000;

int w,h,n;

int ans = 0;

int d[1001][1001];

typedef struct p{

	int x, y;

}P;

string mapp[1001];

P nezumi[11];





//幅優先探索を行う

void bfs(){

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

		P sp = nezumi[i-1];

		int sx = nezumi[i-1].x;

		int sy = nezumi[i-1].y;

		int gx = nezumi[i].x;

		int gy = nezumi[i].y;



		//二次元配列の初期化をする

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

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

				d[y][x] = First;

			}

		}

		

		queue<P> q;

		q.push( sp );

		d[sy][sx] = 0;

		while( !q.empty() ){

			P now = q.front();

			q.pop();

			int x = now.x;

			int y = now.y;



			if( x == gx && y == gy ){

				ans += d[gy][gx];



				/*動作確認

				cout << "\n";

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

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

						if (d[y][x]==First){cout << "X";}

							else{cout << d[y][x];}

					}

					cout << "\n";

				}*/

				break;

			}



			//redandblackと同じように探索

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

				int newx = x + dx[i];

				int newy = y + dy[i];

				if( newx < 0 || newy < 0 || newx >= w || newy >= h ) continue;

				if( mapp[newy][newx] != 'X' ){

					P next;

					next.x = newx;

					next.y = newy;

					if( d[newy][newx] == First ){

						d[newy][newx] = d[y][x] + 1;

						q.push( next );

					}

				}

			}

		}

	}

}



int main(){

	//標準入力

	cin >> h >> w >> n;

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

		cin >> mapp[y];

	}

	

	//スタートと数字の確認

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

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

			char c = mapp[y][x];



			//アスキー使っていい感じにしてみる

			if( c >= '1' && c <= '9' ){

				nezumi[ c - '0' ].x = x;

				nezumi[ c - '0' ].y = y;

			}

			if(c == 'S'){

				nezumi[0].x = x;

				nezumi[0].y = y;

			}

		}

	}

	bfs();

	cout << ans << endl;

}