// Slower C++ solution:
/*

*

*/

#include<iostream>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<string>

#include<queue>

#define CLR(ARR,NUM) memset(ARR,NUM,sizeof(ARR))

#define GETNUM(NUM) scanf("%d",&NUM)

#define faster_io() ios_base::sync_with_stdio(false)

using namespace std;

const int MAXN = 1010;

char map[MAXN][MAXN];

bool vis[10][MAXN][MAXN];

struct node{

	int x;

	int y;

	int deep;

	int n;

};

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

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



int main()

{

	CLR(vis,false);

	CLR(map,'X');

	int h,w,n;

	cin >> h >> w >> n;

	getchar();

	int sx,sy;

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

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

			map[i][j]=getchar();

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

				sx=i;

				sy=j;

			}

		}

		getchar();

	}

	node t;

	t.x=sx;

	t.y=sy;

	t.deep=0;

	t.n=0;

	queue<node>q;

	vis[0][sx][sy]=true;

	q.push(t);

	int ans = -1;

	while(!q.empty()){

		node cur=q.front();

		if(cur.n==n){

			ans=cur.deep;

			break;

		}

		q.pop();

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

			int tx=cur.x+dx[i];

			int ty=cur.y+dy[i];

			if(map[tx][ty]!='X'&&!vis[cur.n][tx][ty]){

				node t = cur;

				t.x=tx;

				t.y=ty;

				t.deep++;

				if(map[tx][ty]=='1'+t.n){

					t.n++;

				}

				vis[t.n][tx][ty]=true;

				q.push(t);

			}

		}

	}

	cout << ans << endl;

	return 0;

}

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

#include<iostream>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<algorithm>

#include<string>

#include<cstring>

#include<cstdlib>

#include<cctype>

#include<sstream>

#include<stack>

#include<functional>

using namespace std;

typedef long long ll;

typedef pair<int, int> P;

const int INF=0x3f3f3f3f;

const int MAX_N = 10;

const int MAX_H = 1005;

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

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

struct T{

    int x,y;

};//坐?

char G[MAX_H][MAX_H];

T aim[MAX_N];

int vis[MAX_H][MAX_H]; // ???数

int H, W, N;

T s, t; //起点，?点



int bfs(){

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

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

            vis[i][j] = -1;

    queue<T> q;

    q.push(s);

    vis[s.x][s.y] = 0;

    while(!q.empty()){

        T cur = q.front();

        q.pop();

        if(cur.x == t.x && cur.y == t.y)break;

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

            T nxt;

            nxt.x = cur.x + dx[i];

            nxt.y = cur.y + dy[i];

            if(nxt.x >= 0 && nxt.x < H && nxt.y >= 0 && nxt.y < W && vis[nxt.x][nxt.y] == -1 && G[nxt.x][nxt.y] != 'X'){

                q.push(nxt);

                vis[nxt.x][nxt.y] = vis[cur.x][cur.y] + 1;

            }

        }

    }

    return vis[t.x][t.y];

}



void solve(){

    int ans = 0;

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

        t = aim[i]; //?个?酪??点

        ans += bfs();

        s = t; //?次?点??下次起点

        G[s.x][s.y] = '.';

	}

	cout << ans << endl;

}

int main()

{

	#ifdef LOCAL

		freopen("in.txt","r",stdin);

	//	freopen("out.txt","w",stdout);

	#endif

	//ios::sync_with_stdio(false);

	cin >> H >> W >> N;

	int p = 0;

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

        scanf("%s", G[i]);

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

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

                s.x = i;s.y =j;

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

            }

            else if(G[i][j] <= '9' && G[i][j] >= 0){

                int num = G[i][j] - '0' - 1;

                aim[num].x = i;aim[num].y = j;

            }

        }

	}

	solve();

	return 0;

}