// Slower C++ solution:
//

//  AOJ 0558 Chees

//

//  Created by TaoSama on 2015-02-20

//  Copyright (c) 2014 TaoSama. All rights reserved.

//

#include <algorithm>

#include <cctype>

#include <cmath>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iomanip>

#include <iostream>

#include <map>

#include <queue>

#include <string>

#include <set>

#include <vector>

#define CLR(x,y) memset(x, y, sizeof(x))



using namespace std;

const int INF = 0x3f3f3f3f;

const int MOD = 1e9 + 7;

const int N = 1e5 + 10;



struct Point {

	int x, y;

	Point(int x = 0, int y = 0): x(x), y(y) {}

} c[15];

int n, m, k, dp[1005][1005];

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

char a[1005][1005];



int bfs(int x) {

	memset(dp, 0x3f, sizeof dp);

	queue <Point> q; q.push(c[x - 1]);

	dp[c[x - 1].x][c[x - 1].y] = 0;

	while(!q.empty()) {

		Point cur = q.front(); q.pop();

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

			Point nxt(cur.x + d[i][0], cur.y + d[i][1]);

			if(nxt.x < 1 || nxt.x > n || nxt.y < 1 || nxt.y > m

			        || a[nxt.x][nxt.y] == 'X') continue;

			if(dp[nxt.x][nxt.y] == INF) {

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

				q.push(nxt);

			}

		}

	}

	return dp[c[x].x][c[x].y];

}

int main() {

#ifdef LOCAL

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

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

#endif

	ios_base::sync_with_stdio(0);



	while(cin >> n >> m >> k) {

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

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

				cin >> a[i][j];

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

					c[0].x = i, c[0].y = j;

				if(isdigit(a[i][j]))

					c[a[i][j] - '0'].x = i, c[a[i][j] - '0'].y = j;

			}

		}

		int ans = 0;

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

			ans += bfs(i);

		cout << ans << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.5411595040369916x):
#include <bits/stdc++.h>

/*

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <ext/rb_tree>

*/

#define mem(x,y) memset(x,y,sizeof(x))

//#define P(x) cout<<#x<<" = "<<x<<endl;

#define PN(x,n) cout<<'{'<<x[0];for(int i=1;i<n;i++)cout<<','<<x[i];cout<<'}'<<endl;

#define RP(i,n) for(int i=0;i<n;i++)

#define RP2(i,a,b) for(int i=a;i<=b;i++)

#define mp make_pair

#define P pair<int,int>

#define pb push_back

#define fi first

#define se second

#define inf 0x3f3f3f3f

#define dinf 1e99

#define OJ

#define ite iterator

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

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

using namespace std;/*

using namespace __gnu_cxx;

using namespace __gnu_pbds;

typedef long long ll;

typedef unsigned long long ull;

typedef tree<int, int, less<int>, rb_tree_tag, tree_order_statistics_node_update> Tree;

const double PI = acos(-1.0);  

const double eps = 1e-5;

const double T = 5; //t of fire

const double delta = 0.99; //decreasing speed of t

const int INF = 1000000000;*/

const int maxn=1005;

bool vis[maxn][maxn];

int d[maxn][maxn];

int ans,n,m,k,sx,sy;

int lx[maxn],ly[maxn],G[maxn][maxn];

char bf;

queue<P> q;

int bfs(int sx,int sy,int ex,int ey){

    mem(vis,0);

    q.push(mp(sx,sy));

    vis[sx][sy] = 1;

    d[sx][sy] = 0;

    while(!q.empty()){

	P u = q.front(); q.pop();

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

	    P v=mp(u.fi+dx[dr],u.se+dy[dr]);

	    if(v.fi<1 || v.se<1 || v.fi>n || v.se>m || vis[v.fi][v.se] || G[v.fi][v.se]) continue;

	    d[v.fi][v.se]=d[u.fi][u.se] + 1;

	    vis[v.fi][v.se] = 1;

	    q.push(v);

	}

    }

    return d[ex][ey];

}

int main(){

    cin>>n>>m>>k;

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

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

	    cin>>bf;

	    if(bf=='.') G[i][j] = 0;

	    else if(bf == 'S') sx = i, sy = j, G[i][j] = 0;

	    else if(bf=='X') G[i][j] = 1;

	    else lx[bf-48] = i, ly[bf-48]=j;

	}

    }

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

	ans += bfs(sx,sy,lx[i],ly[i]);

	sx=lx[i], sy=ly[i];

    }

    cout<<ans<<endl;

    return 0;

}