// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
uint Nxt[1000005],Go[1000005];chr C[505][505];
const uint dx[]={1,0,-1u,0},dy[]={0,1,0,-1u};
std::vector<uint>To[250005];
uint Dist[9][9][250005];
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n,h,w;scanf("%u%u%u",&n,&w,&h);
    for(uint i=0;i<h;i++)scanf("%s",C[i]);
    for(uint i=0;i<h;i++)for(uint j=0;j<w;j++)if(C[i][j]!='x')for(uint op=0,x,y;op<4;op++)
        Nxt[(i*w+j)<<2|op]=(x=i+dx[op])<h&&(y=j+dy[op])<w&&C[x][y]!='x'?(x*w+y)<<2
                                    |(C[x][y]=='A'?(op+1)&3:(C[x][y]=='C'?(op+3)&3:op)):-1u;
    else Nxt[(i*w+j)<<2]=Nxt[(i*w+j)<<2|1]=Nxt[(i*w+j)<<2|2]=Nxt[(i*w+j)<<2|3]=-1;
    for(uint i=0;i<h*w*4;i++)Go[i]=-1;
    for(uint i=0;i<h*w*4;i++)if(~Nxt[i])Go[Nxt[i]]=i;
    for(uint i=0,p;i<h*w*4;i++)if(!~Nxt[i]){p=i;while(~p)To[p>>2].push_back(i>>2),p=Go[p];}
    for(uint i=0;i<n;i++)for(uint j=i;j<n;j++)for(uint k=0;k<h*w;k++)Dist[i][j][k]=2e9;
    for(uint i=0;i<h;i++)for(uint j=0;j<w;j++)if(C[i][j]>='1'&&C[i][j]<='9')Dist[C[i][j]-'1'][C[i][j]-'1'][i*w+j]=0;
    for(uint len=0;len<n;len++)
    {
        if(len)for(uint l=0;l+len<n;l++)for(uint mid=l;mid<l+len;mid++)for(uint k=0;k<h*w;k++)
            _min(Dist[l][l+len][k],Dist[l][mid][k]+Dist[mid+1][l+len][k]);
        for(uint l=0;l+len<n;l++)
        {
            uint*D=Dist[l][l+len];
            static bol G[250005];
            std::vector<uint>V;std::queue<uint>Q;
            for(uint k=0;k<h*w;k++)
            {
                G[k]=false;
                if(D[k]<1e9)V.push_back(k);
            }
            std::sort(V.begin(),V.end(),[&](uint a,uint b){return D[a]>D[b];});
            while(Q.size()||V.size())
            {
                uint p;
                if(Q.size()&&(V.empty()||D[Q.front()]<D[V.back()]))p=Q.front(),Q.pop();else p=V.back(),V.pop_back();
                for(auto s:To[p])if(_min(D[s],D[p]+1))G[s]=true,Q.push(s);
                while(V.size()&&G[V.back()])V.pop_back();
            }
            // for(uint i=0;i<h*w;i++,putchar(" \n"[!(i%w)]))if(D[i]<1e9)printf("%2u",D[i]);else printf("-1");
            // puts("");
        }
    }
    uint ans=2e9;
    for(uint i=0;i<h*w;i++)_min(ans,Dist[0][n-1][i]);
    if(ans<1e9)printf("%u\n",ans);else puts("-1");
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。