// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1024;



int h, w, n, maze[MAX][MAX];

int b[15];

int r[] = {1, -1, 0, 0};

int z[] = {0, 0, -1, 1};

int d[MAX][MAX];

int ans = 0;



int readchar() {

    for(;;) {

        int ch = getchar();

        if(ch != '\n' && ch != '\r') return ch;

    }

}



int bfs(int x, int y, int x2, int y2)

{

    //cout << x << y << x2 << y2 << endl;



    queue<int> q;

    q.push(x * 10000 + y);

    while(!q.empty()) {

        int v = q.front();

        q.pop();

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

            int x1 = v / 10000 + r[i];

            int y1 = v % 10000 + z[i];

            if(x1 == x2 && y1 == y2) {

                d[x1][y1] = d[v / 10000][v % 10000] + 1;

                return 0;

            }

            if(x1 >= 0 && y1 >= 0 && x1 < h && y1 < w && maze[x1][y1] != 'X' && d[x1][y1] == -1) {

                 d[x1][y1] = d[v / 10000][v % 10000] + 1;

                 q.push(x1 * 10000 + y1);

            }

        }

    }

    return 0;

}

int main()

{

    cin >> h >> w >> n;

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

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

             maze[i][j] = readchar();

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

            b[0] = i * 10000 + j;

        }

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

            b[maze[i][j] - '0'] = i * 10000 + j;

        }

    }

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

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

        d[b[i] / 10000][b[i] % 10000] = 0;

        bfs(b[i] / 10000, b[i] % 10000, b[i + 1] / 10000, b[i + 1] % 10000);

        ans += d[b[i + 1] / 10000][ b[i + 1] % 10000];

    }

    cout << ans << endl;

    return 0;

}

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

#include<algorithm>

#include<queue>

const int INF = 100000000;

using namespace std;

typedef pair<int, int> P;

char a[1005][1005];

int N, M;

int sx, sy;

int gx, gy;

int d[1005][1005];

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

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

int bfs()

{

	queue<P> que;

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

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

			d[i][j] = INF;

	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];

			if (nx >= 0 && nx < N&&ny >= 0 && ny < M&&a[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(void)

{

	while (cin >> N >> M)

	{

		int n, sum = 0;

		cin >> n;

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

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

				cin >> a[i][j];

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

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

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

				{

					sx = j;

					sy = k;

				}

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

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

				if (a[j][k] == '1')

				{

					gx = j;

					gy = k;

				}

		sum += bfs();

		for (int i = 0; i < n - 1; i++)

		{

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

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

				{

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

					{

						sx = j;

						sy = k;

					}

					if (a[j][k] == (char)(i+50))

					{

						gx = j;

						gy = k;

					}

				}

			sum += bfs();



		}

		cout << sum << endl;

	}

}