// 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: 5.152398730977165x):
#include<bits/stdc++.h>

using namespace std;



#define PS push

#define PB push_back

#define MP make_pair

#define fi first

#define se second

const int INF = 0x3f3f3f3f;

#define cer(x) cout<<#x<<'='<<endl

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

#define REP1(i,n) for(int i = 1; i <= n; i++)

#define DWN(i,n) for(int i = n; i > 0; i--)

#define DWN_(i,n) for(int i = n; i >= 0; i--)

#define REP(i,s,e) for(int i = s; i < e; i++)

#define REP_(i,s,e) for(int i = s; i <= e; i++)

#define CLR(a,v) memset(a,v,sizeof(a))

typedef long long ll;



inline int read()

{

    int ret; char c; while(c = getchar(),c<'0'||c>'9');

    ret = c-'0';

    while(c = getchar(),c>='0'&&c<='9') ret = ret*10 + c-'0';

    return ret;

}



inline int reads()

{

    int ret; char c; while(c = getchar(),c != '-' && (c<'0'||c>'9'));

    bool Sign = c == '-';

    ret = Sign?0:c-'0';

    while(c = getchar(),c>='0'&&c<='9') ret = ret*10 + c-'0';

    return Sign?-ret:ret;

}



const int SZ = 1e3+5;



char g[SZ][SZ];

int H,W,N;

int vis[SZ][SZ],clk;

struct Node

{

    int x,y,f,h;

    bool operator <(const Node&th) const {

        return f > th.f || ( f == th.f && h > th.h);

    }

}pos[10];



int tar;

inline int MHT(Node &o)

{

    return (abs(pos[tar].x-o.x) + abs(pos[tar].y-o.y))>>1;

}



void GetPos()

{

    REP0(i,H){

        REP0(j,W){

            char c = g[i][j];

            if(c == 'S'){

                pos[0] = {i,j};

            }else if('1'<= c && c <='9' ){

                pos[c-'0'] = {i,j};

            }

        }

    }

}



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

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



inline bool valid(int x,int y)

{

    return x>=0&&x<H&&y>=0&&y<W&&g[x][y]!='X'&&vis[x][y] != clk;

}



int astar_bfs(int st)

{

    priority_queue<Node> q;

    Node u;

    u.x = pos[st].x;

    u.y = pos[st].y;

    u.h = u.f = MHT(u);

    q.push(u);

    clk++;

    while(q.size()){

        u = q.top(); q.pop();

        if(u.x == pos[tar].x && u.y == pos[tar].y ) return u.f-u.h;

        REP0(k,4){

            Node v;

            v.x = u.x + dx[k];

            v.y = u.y + dy[k];

            if(!valid(v.x,v.y)) continue;

            vis[v.x][v.y] = clk;

            v.h = MHT(v);

            v.f = u.f-u.h+1+v.h;

            q.push(v);

        }

    }

    return -1;

}



int main()

{

#ifdef LOCAL

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

#endif

    H = read(); W = read(); N = read();

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

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

    }

    GetPos();

    int ans = 0;

    REP1(i,N){

        tar = i;

        ans += astar_bfs(i-1);

    }

    printf("%d\n",ans);

    return 0;

}