// 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.73518324066107x):
#include <iostream>

#include <queue>

using namespace std;

int w, h, n;

char map[1024][1024];

int d[1024][1024];

const int direction[4][2] = {

    { -1, 0 },

    { 1, 0 },

    { 0, -1 },

    { 0, 1 },

};

int factory[16][2];

typedef pair<int, int> P;

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

{

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

    {

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

        {

            d[i][j] = -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 + direction[i][0];

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

            if (0 <= nx && nx < h && 0 <= ny && ny < w && map[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(int argc, char *argv[])

{



    cin >> h >> w >> n;

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

    {

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

        {

            cin >> map[i][j];

        }

    }



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

    {

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

        {

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

            {

                factory[0][0] = i;

                factory[0][1] = j;

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

            }

            else if (isdigit(map[i][j]))

            {

                int index = map[i][j] - '0';

                factory[index][0] = i;

                factory[index][1] = j;

            }

        }

    }



    int step = 0;

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

    {

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

    }



    cout << step << endl;



    return 0;

}

///////////////////////////End Sub//////////////////////////////////