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

#include<cstring>

#include<iostream>

#include<queue>

#include<vector>

#include<algorithm>

#include<string>

#include<cmath>

#include<set>

#include<map>

#include<vector>

#include<stack>

#include<utility>

#include<sstream>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int maxn = 1005;

int a[1005][1005];

int x[20], y[20];

int ans, w, h, n;

bool leap[1005][1005];

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

struct Node

{

	int x, y, t;

	Node(int x, int y, int t) :x(x), y(y), t(t){}

};

int work(int xx, int yy, int pos)

{

	memset(leap, false, sizeof(leap));

	leap[xx][yy] = 1;

	queue<Node>p;

	p.push(Node(xx, yy, 0));

	while (p.size())

	{

		Node temp = p.front();

		p.pop();

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

		{

			int tempx = temp.x + dir[i][0];

			int tempy = temp.y + dir[i][1];

			if (tempx >= 1 && tempx <= h&&tempy >= 1 && tempy <= w)

			{

				if (a[tempx][tempy] == 1)continue;

				if (leap[tempx][tempy] == 1)continue;

				if (tempx == x[pos + 1] && tempy == y[pos + 1])

				{

					return temp.t + 1;

				}

				leap[tempx][tempy] = 1;

				p.push(Node(tempx, tempy, temp.t + 1));

			}

		}

	}



}

int main()

{

#ifdef LOCAL

	freopen("C:\\Users\\ΡΡ\\Desktop\\in.txt", "r", stdin);

	//freopen("C:\\Users\\ΡΡ\\Desktop\\out.txt","w",stdout);

#endif // LOCAL

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

	{

		char s[1005];

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

		{

			scanf("%s", s);

			for (int j = 1; j <= w; j++)

			{

				if (s[j - 1] == '.')

					a[i][j] = 0;

				else if (s[j - 1] == 'X')

					a[i][j] = 1;

				else if (s[j - 1] == 'S')

				{

					x[0] = i; y[0] = j;

					a[i][j] = 0;

				}

				else

				{

					a[i][j] = 0;

					int id = s[j - 1] - '0';

					x[id] = i; y[id] = j;

				}

			}

		}

		ans = 0;

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

		{

			ans = ans + work(x[i], y[i], i);

		}

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

	}

	return 0;

}

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

#include <stdio.h>

#include <deque>



using namespace std;



const int INF = 0x3f3f3f3f;

typedef pair<int, int> P;

int h, w, n;

int sx, sy;

int gx, gy;

char cmap[1000][1000];

int goalSum;

int goal[10];

int d[1000][1000];

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

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



int bfs() {

    int res = 0;

    deque<P> que;

    for (int ci = 0; ci < n; ci++) {  //要?行n次循?，?找n次?点，?次?数?入goal[i], 最后累加起来是res 

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

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

                d[i][j] = INF;

            }

        }

        

        que.push_back(P(sx, sy));

        d[sx][sy] = 0;

        

        while(que.size()) {            

            int x = que.front().first;

            int y = que.front().second;

                        

            if ((int)cmap[x][y] == 49 + ci) {

                goal[ci] = d[x][y];

                sx = x;

                sy = y;

                break;

            }

            

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

                int nx = x + dx[i];

                int ny = y + dy[i];

                if (nx >=0 && nx < h && ny >= 0 && ny < w && cmap[nx][ny] != 'X' && d[nx][ny] == INF) {

                    que.push_back(P(nx, ny));

                    d[nx][ny] = d[x][y] + 1;

                }

            }    

            que.pop_front();        

        }

        que.clear(); 

        res += goal[ci];

    }

    return res;

}



int main() {

    cin >> h >> w >> n;

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

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

            cin >> cmap[i][j];

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

                sx = i;

                sy = j;

            }

        }

    }

    goalSum = bfs();

    cout << goalSum << endl;

    return 0;

}