#include<bits/stdc++.h>
using namespace std;
char s[505][505];
int f[10][10][250005];
#define mk(x,y) (((x)-1)*w+(y))
vector<int>gg[1000005];
int dd[1000005];
vector<int>g[250005];
int N;
int dist[250005];
vector<int>pp[250005];
void bfs(int l,int r){
	for(int i=0;i<=N;++i)pp[i].clear();
	for(int i=1;i<=N;++i){
		dist[i]=f[l][r][i];
		if(dist[i]<=N)pp[dist[i]].emplace_back(i);
	}
	queue<int>q;
	for(int i=0;i<=N;++i){
		for(auto cu:pp[i])if(dist[cu]==i)q.emplace(cu);
		queue<int>qq;
		while(q.size()){
			int x=q.front();
			q.pop();
			for(auto cu:g[x]){
				if(dist[cu]>dist[x]+1){
					dist[cu]=dist[x]+1;
					qq.emplace(cu);
				}
			}
		}
		q=qq;
	}
	while(q.size()){
		int x=q.front();
		q.pop();
		for(auto cu:g[x]){
			if(dist[cu]>dist[x]+1){
				dist[cu]=dist[x]+1;
				q.emplace(cu);
			}
		}
	}
	for(int i=1;i<=N;++i)f[l][r][i]=dist[i];
}
int mb[4][2]={{-1,0},{0,1},{1,0},{0,-1}};
int main(){
	int n,w,h;
	scanf("%d%d%d",&n,&w,&h);
	N=w*h;
	for(int i=1;i<=h;++i)scanf("%s",s[i]+1);
	queue<int>q;
	memset(dd,63,sizeof(dd));
	for(int i=1;i<=h;++i)for(int j=1;j<=w;++j){
		int wz=(mk(i,j)-1)*4;
		for(int k=0;k<4;++k){
			int kk=k;
			if(s[i][j]=='A')kk=(k+3)%4;
			if(s[i][j]=='C')kk=(k+1)%4;
			int dx=i+mb[kk][0],dy=j+mb[kk][1];
			int zz=wz+k+1;
			if(dx<1||dx>h||dy<1||dy>w||s[dx][dy]=='x'){
				dd[zz]=mk(i,j);
				q.emplace(zz);
			}else{
				int zw=(mk(dx,dy)-1)*4;
				int yy=zw+kk+1;
				gg[yy].emplace_back(zz);
			}
		}
	}
	while(q.size()){
		int x=q.front();
		q.pop();
		for(auto cu:gg[x]){
			dd[cu]=dd[x];
			q.emplace(cu);
		}
	}
	for(int i=1;i<=h;++i)for(int j=1;j<=w;++j)
		for(int k=0;k<4;++k){
			int zz=mk(i,j)*4-3+k;
			if(dd[zz]<=1e9)g[mk(i,j)].emplace_back(dd[zz]);
		}
	memset(f,63,sizeof(f));
	for(int i=1;i<=h;++i)for(int j=1;j<=w;++j){
		if(isdigit(s[i][j])){
			int ww=s[i][j]-'0';
			f[ww][ww][mk(i,j)]=0;
		}
	}
	for(int i=1;i<=n;++i)bfs(i,i);
	for(int l=2;l<=n;++l)for(int i=1;i<=n-l+1;++i){
		int j=i+l-1;
		for(int k=1;k<=N;++k){
			for(int s=i;s<j;++s)
				f[i][j][k]=min(f[i][j][k],f[i][s][k]+f[s+1][j][k]);
			for(int s=i+1;s<j;++s)for(int t=i;t<j;++t){
				f[i][j][k]=min(0ll+f[i][j][k],0ll+f[i][s-1][k]+f[s][t][k]+f[t+1][j][k]);
			}
		}
		bfs(i,j);
	}
	int ans=INT_MAX;
	for(int i=1;i<=N;++i)ans=min(ans,f[1][n][i]);
	if(ans>1e9)ans=-1;
	printf("%d\n",ans);
	return 0;
}