// Slower C++ solution:


#include <iostream>

#include <cstdio>

#include <cstring>

#include <queue>



using namespace std;

const int maxn = 1e3 + 5;

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

int mp[maxn][maxn];

//bool vis[maxn][maxn];

int d[maxn][maxn];

struct point{

    int x,y;

};

int h,w,n;

 int dis = 0;

void bfs(point &p,int cnt)

{

   // memset(vis, 0, sizeof(vis));

    memset(d, 0, sizeof(d));

    queue<point> q;

    q.push(p);

    while (!q.empty()) {

        point t = q.front();q.pop();

        //vis[t.x][t.y] = true;

        if(mp[t.x][t.y] == cnt + 1) {dis += d[t.x][t.y];p.x = t.x,p.y = t.y;return ;}

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

            int tx = t.x + dir[i][0];

            int ty = t.y + dir[i][1];

            if (tx >= 0 && tx < h && ty >= 0 && ty < w && !d[tx][ty] && mp[tx][ty] != -1) {

                q.push({tx,ty});

                d[tx][ty] = 1 + d[t.x][t.y];

            }

        }

    }

}

int main()

{

    while (scanf("%d%d%d",&h,&w,&n) != EOF) {

        getchar();

        char ch;

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

       // int sx,sy;

        point s;

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

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

                scanf("%c",&ch);

                if(ch == 'S') {s.x = i,s.y = j;mp[i][j] = 0;}

                else if(ch == '.') {mp[i][j] = 0;}

                else if(isdigit(ch)) {mp[i][j] = ch - '0';}

            }

            getchar();

        }

       

        dis = 0;

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

            bfs(s,i);

        }

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

    }

    return 0;

}

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

	}

}