// Slower C++ solution:
//

// Create by 神舟 on 2015-02-21

//



#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <cstdlib>

#include <algorithm>

#include <cctype>

#include <stack>

#include <queue>

#include <map>

#include <string>

#include <set>

#include <vector>

using namespace std;



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

#define ll long long

#define inf 0x3f3f3f3f

const int maxn=1e3+5;

const int MOD=5e5+5;

int n,m,t,sx,sy,ex,ey;

char word[maxn][maxn];

int path[maxn][maxn];

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



struct pnt

{

    int x,y;

    pnt(int x=0,int y=0):x(x),y(y){};

};



void bfs()

{

    memset(path,0x3f,sizeof path);

    queue <pnt> que;

    pnt p,np;

    p.x=sx,p.y=sy;

    path[sx][sy]=0;

    que.push(p);

    while(!que.empty()){

        p=que.front();que.pop();

        if(p.x==ex&&p.y==ey) {return;}

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

            np.x=p.x+dir[i][0];

            np.y=p.y+dir[i][1];

            if(np.x>0 && np.x<=n && np.y>0 && np.y<=m && path[np.x][np.y]>path[p.x][p.y]+1 && word[np.x][np.y]!='X')

            {

                path[np.x][np.y]=path[p.x][p.y]+1;

                que.push(np);

            }

        }

    }

}

int main()

{

#ifdef LOCAL

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

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

#endif

	ios_base::sync_with_stdio(0);



	while(scanf("%d%d%d",&n,&m,&t)!=EOF){

        ans=0;

        CLR(word);

        for(int i=1;i<=n;scanf("%s",word[i++]+1));

        for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(word[i][j]=='S') word[i][j]='0';

        for(int k=0;k<t;k++){

            char tp=k+'0';

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

                if(word[i][j]==tp) sx=i,sy=j;

                if(word[i][j]==tp+1) ex=i,ey=j;

            }

            bfs();

            ans+=path[ex][ey];

            //printf("%d\t",path[ex][ey]);

        }

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

	}



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.212872403728363x):
#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;

}