// 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.9914828294969518x):
/* AOJ0558 Cheese */



#include <iostream>

#include <queue>

//#include <string.h>



using namespace std;



const int N = 1000;

char grid[N][N];

int w, h, n;



// 各点到当前工厂的距?

int d[N][N];



const int direct[4][2] = {

    { -1, 0 },

    { 1, 0 },

    { 0, -1 },

    { 0, 1 },

};



int factory[10][2];

typedef pair<int, int> P;



int bfs(const int& sx, const int& sy, const int& gx, const int& gy)

{

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

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

    {

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

        {

            d[j][i] = -1;

        }

    }

    queue<P> que;

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

    d[sx][sy] = 0;

    while (que.size())

    {

        const 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 + direct[i][0];

            int ny = p.second + direct[i][1];

            // 是否可以移?，并且?点没有???

            if (0 <= nx && nx < w && 0 <= ny && ny < h && grid[nx][ny] != 'X' && d[nx][ny] == -1)

            {

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

                d[nx][ny] = d[p.first][p.second] + 1;

            }

        }

    }



    return d[gx][gy];

}



int main()

{



    while(cin >> h >> w >> n) {

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

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

                cin >> grid[j][i];

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

                    factory[0][0] = j;

                    factory[0][1] = i;

                    grid[j][i] = '.';

                }

                else if (isdigit(grid[j][i])) {

                    factory[grid[j][i] - '0'][0] = j;

                    factory[grid[j][i] - '0'][1] = i;

                }

            }





        int minstep = 0;

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

            minstep += bfs(factory[i][0], factory[i][1], factory[i + 1][0], factory[i + 1][1]);

        }



        cout << minstep << endl;

    }



    return 0;

}