// Slower C++ solution:
/************************************************

* Author        :somniloquy

* Created Time  :2015/10/30 16:15:09

 ************************************************/



#include <cstdio>

#include <algorithm>

#include <iostream>

#include <cstring>

#include <queue>



using namespace std;



const int hw_max = 1000 + 5;

char graph[hw_max][hw_max];

int sign[hw_max][hw_max];

int h, w, n, ans;

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

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

struct node

{

	int x;

	int y;

	int time;

} start;



void BFS(node op, char ed)

{

	queue <node> process;

	process.push(op);

	sign[op.x][op.y] = 1;

	while(!process.empty())

	{

		node now = process.front();

		process.pop();

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

		{

			node next = now;

			next.x += dx[i];

			next.y += dy[i];

			next.time ++;

			if(next.x >= 0 && next.x < h && next.y >= 0 && next.y < w && graph[next.x][next.y] != 'X' && !sign[next.x][next.y])

			{

				if(graph[next.x][next.y] == ed)

				{

					ans += next.time;

					next.time = 0;

					start = next;

				       	return;

				}

				else

				{

					process.push(next);

					sign[next.x][next.y] = 1;

				}

			}

		}

	}

}



int main()

{

	while(~scanf("%d %d %d", & h, & w, & n))

	{

		getchar();

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

		{

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

			{

			       scanf("%c", & graph[i][j]);

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

			       {

					start.x = i;

					start.y = j;

					start.time = 0;

			       }

			}

			getchar();

		}

		ans = 0;

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

		{

			memset(sign, 0, sizeof(sign));

			BFS(start, '0' + i);

		}

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

	}

	return 0;

}

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

#include <cstdio>

#include <queue>

#include <algorithm>

#include <cstring>

#include <string>

#include <stack>

#include <stdlib.h>

#include <cctype>

#include <vector>

#include <map>

#include <set>

#include <cmath>

#include <iomanip>

using namespace std;

const int INF=1000000000;

const int max_n=1005;

typedef pair<int,int>P;

char maze[max_n][max_n+1];

int n,m,sx,sy;

int d[max_n][max_n];

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

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

int bfs(char e)

{

    queue<P>que;

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

        for(int j=0;j<m;j++)d[i][j]=INF;

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

    d[sx][sy]=0;

    while(!que.empty())

    {

        P q=que.front();

        que.pop();

        if(maze[q.first][q.second]==e){sx=q.first;sy=q.second;break;}

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

        {

            int nx=q.first+dx[i],ny=q.second+dy[i];

            if(0<=nx&&nx<n&&ny>=0&&ny<m&&maze[nx][ny]!='X'&&d[nx][ny]==INF)

            {

                que.push(P(nx,ny));

                d[nx][ny]=d[q.first][q.second]+1;

            }

        }

    }

return d[sx][sy];

}

int main()

{

    int t;

    while(cin>>n>>m>>t)

    {

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

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

       {

           cin>>maze[i][j];

           if(maze[i][j]=='S')sx=i,sy=j;

       }



       int res=0;

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

        res+=bfs(i+'0');

       }

        cout<<res<<endl;

    }

    return 0;

}