// Slower C++ solution:
#include <iostream>

#include<algorithm>

#include<cstdio>

#include<cstring>

#include<string>

#include<cstdlib>

#include<stack>

#include<queue>

#include <map>

#include<cmath>

#include<vector>

#define MAX_N 1000000

#define INF 0x3f3f3f3f

#define SIZE 1000

using namespace std;







struct note

{

    int x, y;

}start, ende;

typedef pair<int, int> P;

int H, W, N;

char a[1003][1003];

int sum;

int d[1003][1003];

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

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

void bfs(note h, note m)

{

    memset(d, -1, sizeof(d));

    queue<P> que;

    que.push(P(h.x, h.y));

    d[h.x][h.y] = 0;

    while (!que.empty())

    {

        P p = que.front();

        que.pop();

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

        {

            int xx = p.first + dx[i];

            int yy = p.second + dy[i];

            if (xx >= 0 && xx < H && yy >= 0 && yy < W && a[xx][yy] != 'X' && d[xx][yy] == -1)

            {

                d[xx][yy] = d[p.first][p.second] + 1;

                que.push(P(xx, yy));

            }

        }

    }

    sum += d[m.x][m.y];

    start = ende;

}

void solve()

{

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

    {

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

        {

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

            {

                start.x = i;

                start.y = j;

                i = H;

                j = W;

            }

        }

    }

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

    {

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

        {

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

            {

                if (a[i][j] == k + 49)

                {

                    ende.x = i;

                    ende.y = j;

                    bfs(start, ende);

                    i = H;

                    j = W;

                }

            }

        }

    }

    cout << sum << endl;

}

int main()

{

    cin >> H >> W >> N;

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

    {

        cin >> a[i];

    }

    sum = 0;

    solve();

    return 0;

}

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

#include<cstdio>

#include<queue>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

typedef pair<int,int>P;

const int Max_n=1100;



int n,m,d;

struct Node{

    int x,y,d;

    Node(int xx,int yy,int dd):x(xx),y(yy),d(dd){}

};

char s[Max_n][Max_n];

bool vis[Max_n][Max_n];

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

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



Node bfs(int x1,int y1,int k){

    memset(vis,0,sizeof(vis));

    queue<Node>que;

    que.push(Node(x1,y1,0));

    vis[x1][y1]=1;

    while(!que.empty()){

        Node node=que.front();que.pop();

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

        if(k==s[x][y]-'0')return node;

        int d=node.d;

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

            int X=x+dx[i],Y=y+dy[i];

            if(!vis[X][Y]&&(s[X][Y]=='S'||s[X][Y]=='.'||(s[X][Y]>='1'&&s[X][Y]<='9'))){

                vis[X][Y]=1;

                que.push(Node(X,Y,d+1));

            }

        }

    }

}



int main()

{

    while(~scanf("%d%d%d",&n,&m,&d)){

        memset(s,0,sizeof(s));

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

        int x,y;

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

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

            if(s[i][j]=='S'){x=i;y=j;}

        }

        int sum=0;

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

            Node node=bfs(x,y,i);

            sum+=node.d;

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

        }

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

    }

    return 0;

}