// Slower C++ solution:


#include<iostream>

#include<cstdio>

#include<deque>

#include<algorithm>



using namespace std;



const int maxn=1e3+5;

const int inf=0x3f3f3f3f;



typedef pair<int,int>P;



int h,w,n,sx,sy,book[maxn][maxn],goal[10],Next[4][2]={{0,1},{1,0},{0,-1},{-1,0}};

char s[maxn][maxn];



int judge(int row,int col)

{

    if(row>=0&&row<h&&col>=0&&col<w){

        return 1;

    }

    return 0;

}



int bfs()

{

    int res=0;

    deque<P>q;

    for(int ci=0;ci<n;ci++){

        fill(book[0],book[0]+maxn*maxn,inf);

        q.push_back(P(sx,sy));

        book[sx][sy]=0;

        while(!q.empty()){

            int x=q.front().first;

            int y=q.front().second;

            q.pop_front();

            if((int)s[x][y]==49+ci){

                goal[ci]=book[x][y];

                sx=x;

                sy=y;

                break;

            }

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

                int nx=x+Next[i][0];

                int ny=y+Next[i][1];

                if(judge(nx,ny)&&s[nx][ny]!='X'&&book[nx][ny]==inf){

                    q.push_back(P(nx,ny));

                    book[nx][ny]=book[x][y]+1;

                }

            }

        }

        q.clear();

        res+=goal[ci];

    }

    return res;

}



int main()

{

    cin>>h>>w>>n;

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

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

            cin>>s[i][j];

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

                sx=i;

                sy=j;

            }

        }

    }

    int res=bfs();

    cout<<res<<endl;

    return 0;

}




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

#include <queue>



using namespace std;



char mp[1005][1005];

int vis[1005][1005];

int w, h, n;



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

int ans = 0, sx, sy;

int blood = 1;



struct Node{

	int x,y;

	Node(int _x, int _y){

		x = _x, y = _y;

	}

}; 

typedef struct Node Node; 



queue<Node> que;



void bfs(char t){

//	cout<<"sx = "<<sx<<", sy = "<<sy<<endl;

	que.push(Node(sx, sy));

	ans = 0;

	bool flag = true;

	while(!que.empty()){

//		cout<<"ans = "<<ans<<"n = "<<n<<endl;

		int size = que.size();

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

			Node node = que.front();

			que.pop();

			int x = node.x, y = node.y;

//			cout<<"x = "<<x<<", y = "<<y<<endl;

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

				int tx = x + dirs[i][0], ty = y + dirs[i][1];

				if(tx >= 0 && tx < h && ty >= 0 && ty < w && vis[tx][ty] == 0 && mp[tx][ty] == t){

					sx = tx, sy = ty;

					ans++;

					flag = false;

					return;

				}else if(tx >= 0 && tx < h && ty >= 0 && ty < w && vis[tx][ty] == 0 &&  mp[tx][ty] != 'X'){

//					cout<<"tx = "<<tx<<", ty = "<<ty<<endl;

					que.push(Node(tx, ty));

					vis[tx][ty] = 1;

				}

			} 

		}

		ans++;

	}

	if(flag) ans = 0;

}



int main(){

	cin>>h>>w>>n;

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

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

	}

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

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

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

				sx = i, sy = j;

			}

		}

	}

	int res = 0;

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

		bfs(i + '0');

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

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

				vis[m][k] = 0;

		while(!que.empty())que.pop();

		res += ans;

	}

	cout<<res<<endl;

	return 0;

}



/**

331

S..

...

..1

*/