//```// YF YUSUF
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
#include <string>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <ctime>
using namespace std;
#ifdef YF_CHECK
bool LOCAL = 1;
#else
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
bool LOCAL = 0;
#endif
using i128 = __int128;
using ll = long long;
using ld = long double;
using vll = vector <ll>;
using mll = map <ll,ll>;
using pll = pair <ll,ll>;
using vvl = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
if(b==0)return 1;
ll q=BP(a,b/2,mod);
return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll mod=998244353;
const ll INF=1e18;
const ll inf=1e9+7;
// const ll N =1e6+7;
ll n, w, h;
const ll N =501;
int dp[10][10][N][N];
pll nx[N][N][4], robot[10];
bool used[N][N][4];
char m[N][N];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
vpll g[N][N];
pll next(ll x,ll y,ll k){
if(used[x][y][k])
return nx[x][y][k];
used[x][y][k] = 1;
nx[x][y][k] = {-1, -1};
ll to = k;
if(m[x][y] == 'A')
to = (to + 3)%4;
if(m[x][y] == 'C')
to = (to + 1)%4;
pll now = {x + dx[to], y + dy[to]};
if(now.F < 1 || w < now.F || now.S < 1 || h < now.S || m[now.F][now.S] == 'x')
nx[x][y][k] = {x, y};
else
nx[x][y][k] = next(now.F, now.S, to);
return nx[x][y][k];
}
ll H(pll a){
return a.F * h + a.S - 1;
}
void YF_MAIN(ll TEST){
cin>>n>>w>>h;
swap(h , w);
pll A, B;
for(int i=1;i<=w;i++){
for(int j=1;j<=h;j++){
cin>>m[i][j];
if('1'<=m[i][j]&&m[i][j]<='9') {
robot[m[i][j]-'0']={i,j};
}
}
}
for(int i=1;i<=w;i++){
for(int j=1;j<=h;j++){
for(int t = 0; t < 4; t++){
if(m[i][j]=='x')continue;
pll now = next(i, j, t);
g[i][j].pb(now);
}
}
}
for(int i=1;i<=w;i++)
for(int j=1;j<=h;j++)
for(int l=1;l<=n;l++)
for(int r=l;r<=n;r++)
dp[l][r][i][j]=1e9;
for(int i=1;i<=n;i++) dp[i][i][robot[i].F][robot[i].S] = 0;
for(int len=1;len<=n;len++){
for(int l=1;l<=n-len+1;l++){
int r=l+len-1;
int mn = inf;
priority_queue <pair <ll, pll>> q;
for(int i=1;i<=w;i++){
for(int j=1;j<=h;j++){
for(int md=l;md<r;md++){
MIN(dp[l][r][i][j], dp[l][md][i][j] + dp[md+1][r][i][j]);
}
if(dp[l][r][i][j] != 1e9) q.push({-dp[l][r][i][j], {i, j}});
mn = min(mn , dp[l][r][i][j]);
}
}
while(!q.empty())
{
auto p = q.top();
q.pop();
p.F = -p.F;
if(p.F > dp[l][r][p.S.F][p.S.S]) continue;
for( auto i : g[p.S.F][p.S.S] )
{
if( dp[l][r][i.F][i.S] > p.F + 1 )
{
dp[l][r][i.F][i.S] = p.F + 1;
q.push({-dp[l][r][i.F][i.S], {i.F, i.S}});
}
}
}
}
}
int ans = 1e9;
for(int i=1;i<=w;i++){
for(int j=1;j<=h;j++){
ans = min(ans, dp[1][n][i][j]);
}
}
cout<<(ans == 1e9 ? -1 : ans);
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k ]%FMOD;}
void BEFORE(){
for(ll i=2;i<SN;i++){
if(SM[i])continue;
for(ll j=i;j<SN;j+=i)
MAX(SM[j],i);
}
FACT[0]=inv[0]=1;
for(int i=1;i<FN;i++){
FACT[i]=FACT[i-1]*i%FMOD;
inv[i]=BP(FACT[i],FMOD-2,FMOD);
}
}
signed main(){
// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
if(FLSH){
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(0);
cout.tie(0);
cin.tie(0);
}
cout<<(0 && LOCAL ? "\nYF_OUTPUT:\n\n" : "");
int TEST=1;
if(TECT)
cin>>TEST;
BEFORE();
for(int T=1;T<=TEST;T++){
// cout<<"Case "<<T<<": ";
YF_MAIN(T);
cout<<(T==TEST ? "" : "\n");
}
return 0;
}
// YF YUSUF ```
