#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define N 509
#define R register
using namespace std;
char s[N][N];
int dp[10][10][N*N],h,w,n,lef[5],righ[5],id[N][N],pp,tran[N*N][4],p[N*N];
bool vis[N*N],vi[N*N][4];
int h1,t1,q[N*N],ddf_a,ddf_b;
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};
inline int rd(){int x=0;char c=getchar();bool f=0;while(!isdigit(c)){if(c=='-')f=1;c=getchar();}while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}return f?-x:x;
}
inline bool pd(int i,int j){return i<1||j<1||i>h||j>w||s[i][j]=='x';}
inline bool cmp(int a,int b){return dp[ddf_a][ddf_b][a]<dp[ddf_a][ddf_b][b];}
int dfs(int i,int j,int fx){if(~tran[id[i][j]][fx])return tran[id[i][j]][fx];if(vi[id[i][j]][fx])return 0;vi[id[i][j]][fx]=1;int xx=i+dx[fx],yy=j+dy[fx];    if(pd(xx,yy))return vi[id[i][j]][fx]=0,tran[id[i][j]][fx]=id[i][j];if(s[xx][yy]=='A'){tran[id[i][j]][fx]=dfs(xx,yy,lef[fx]);return vi[id[i][j]][fx]=0,tran[id[i][j]][fx];}if(s[xx][yy]=='C'){tran[id[i][j]][fx]=dfs(xx,yy,righ[fx]);return vi[id[i][j]][fx]=0,tran[id[i][j]][fx];}tran[id[i][j]][fx]=dfs(xx,yy,fx);return vi[id[i][j]][fx]=0,tran[id[i][j]][fx];
}
inline void spfa(int x,int y,int s){q[h1=t1=1]=s;while(h1<=t1){int u=q[h1++];vis[u]=0;for(R int i=0;i<4;++i){int v=tran[u][i];if(v<=0)continue;if(dp[x][y][v]>dp[x][y][u]+1){dp[x][y][v]=dp[x][y][u]+1;if(!vis[v]){vis[v]=1;q[++t1]=v;}}} }
}
int main(){lef[0]=3;lef[3]=1;lef[1]=2;lef[2]=0;righ[0]=2;righ[2]=1;righ[1]=3;righ[3]=0;n=rd();w=rd();h=rd();memset(dp,0x3f,sizeof(dp));memset(tran,-1,sizeof(tran));for(R int i=1;i<=h;++i)scanf("%s",s[i]+1);for(R int i=1;i<=h;++i)for(R int j=1;j<=w;++j)if(!pd(i,j)){id[i][j]=++pp;if(isdigit(s[i][j]))dp[s[i][j]^48][s[i][j]^48][pp]=0;}for(R int i=1;i<=h;++i)for(R int j=1;j<=w;++j)if(!pd(i,j)){for(int k=0;k<4;++k){tran[id[i][j]][k]=dfs(i,j,k);}}for(R int i=1;i<=pp;++i)p[i]=i;for(R int len=1;len<=n;++len)for(R int i=1;i+len-1<=n;++i){int j=i+len-1;for(R int k=1;k<=pp;++k){for(R int f=i;f<j;++f)dp[i][j][k]=min(dp[i][j][k],dp[i][f][k]+dp[f+1][j][k]); }ddf_a=i;ddf_b=j;sort(p+1,p+pp+1,cmp);for(R int k=1;k<=pp;++k)spfa(i,j,p[k]);}int ans=2e9;for(R int i=1;i<=pp;++i)ans=min(ans,dp[1][n][i]);if(ans==inf)puts("-1");else printf("%d",ans);return 0;
}