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

#include <cmath>

#include <queue>

#include <cstdio>

#include <cstring>

#include <algorithm>



#define INF 0x7f7f7f7f

#define PI acos(-1.0)



#define L(x)    (x) << 1

#define R(x)    (x) << 1 | 1

#define lowbit(x)   (x)&(-x)

#define Mid(l, r)   (l + r) >> 1

#define Min(x, y)   (x) < (y) ? (x) : (y)

#define Max(x, y)   (x) < (y) ? (y) : (x)

#define iabs(x)     (x) < 0 ? -(x) : (x)

#define CLR(arr, val)    memset(arr, val, sizeof(arr))



using namespace std;



char map[1024][1024];

bool vis[1024][1024];

int cur, h, w;

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



struct node {

	int x, y, step;

} sta, now;



bool check(int x, int y) {

	if (x >= 0 && x < h && y >= 0 && y < w && !vis[x][y] && map[x][y] != 'X')	return true;

	return false;

}







void bfs(node s) {

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



	queue<node> que;

	s.step = 0;

	que.push(s);

	node next;

	while (!que.empty()) {

//		cout << "h\n";

		s = que.front();

//		cout << s.x << ' ' << s.y << ' ' << cur << endl;

		que.pop();

		if (map[s.x][s.y] == cur + '0')	{

			sta = s;

			return ;

//			s.step;

		}



//		cout << "a\n";

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

//			cout << i << endl;

			next.x = s.x + dir[i][0];

			next.y = s.y + dir[i][1];

			next.step = s.step + 1;

			if (check(next.x, next.y)) {

				vis[next.x][next.y] = true;

				que.push(next);

			}



		}

	}

}



int main() {

	int n;

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

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

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

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

				cin >> map[i][j];

				if (map[i][j] == 'S')	sta.x = i, sta.y = j, map[i][j] = '.';

			}

		}

		sta.step = 0;

		int ans = 0;

		for (cur = 1; cur <= n; cur++) {

			bfs(sta);

			ans += sta.step;

			//cout << ans << endl;

		}

		cout << ans << endl;

	}

	return 0;

}

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

#include <cstdio>

#include <queue>

#include <algorithm>

#include <cstring>

#include <string>

#include <stack>

#include <stdlib.h>

#include <cctype>

#include <vector>

#include <map>

#include <set>

#include <cmath>

#include <iomanip>

using namespace std;

const int INF=1000000000;

const int max_n=1005;

typedef pair<int,int>P;

char maze[max_n][max_n+1];

int n,m,sx,sy;

int d[max_n][max_n];

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

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

int bfs(char e)

{

    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.empty())

    {

        P q=que.front();

        que.pop();

        if(maze[q.first][q.second]==e){sx=q.first;sy=q.second;break;}

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

        {

            int nx=q.first+dx[i],ny=q.second+dy[i];

            if(0<=nx&&nx<n&&ny>=0&&ny<m&&maze[nx][ny]!='X'&&d[nx][ny]==INF)

            {

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

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

            }

        }

    }

return d[sx][sy];

}

int main()

{

    int t;

    while(cin>>n>>m>>t)

    {

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

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

       {

           cin>>maze[i][j];

           if(maze[i][j]=='S')sx=i,sy=j;

       }



       int res=0;

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

        res+=bfs(i+'0');

       }

        cout<<res<<endl;

    }

    return 0;

}