/*
author : TIT_manh
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <numeric>
#include <functional>
#include <cassert>
#include <sstream>
#include <climits>
#define ll long long
#define ull unsigned long long
#define FOR(i,l,r) for (int i = l; i <= r; i++)
#define FOD(i,r,l) for (int i = r; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define m_int 0x3f3f3f3f
#define m_ll 0x3f3f3f3f3f3f3f3f
using namespace std;
const int mxN = 10;
const int mxM = 501;
const int mxD = mxM * mxM * 9 + 5;
int n, h, w;
array<int, 2> e[mxM][mxM][5];
string s[mxM];
//
int di[5] = {0, 0, 1, 0, -1};
int dj[5] = {0, 1, 0, -1, 0};
int ax[mxN][mxN];
int dp[mxN * mxN + 1][mxM][mxM];
vector<array<int, 2>> pos[mxD];
array<int, 2> dfs(int i, int j, int k) {
// huong index la 1
if (e[i][j][k][0] == -1) {
e[i][j][k][0] = -2;
int nk = k;
if (s[i][j] == 'A') nk = ((nk == 1) ? 4 : (nk - 1));
else if (s[i][j] == 'C') nk = ((nk == 4) ? 1 : (nk + 1));
int ni = i + di[nk], nj = j + dj[nk];
if (ni < 1 || nj < 1 || ni > h || nj > w || s[ni][nj] == 'x')
e[i][j][k] = {i, j};
else e[i][j][k] = dfs(ni, nj, nk);
}
return e[i][j][k];
}
void xl(int dp[mxM][mxM], int i, int j, int k) {
if (k < mxD && k < dp[i][j]) {
dp[i][j] = k;
pos[k].pb({i, j});
}
}
void ciin() {
cin >> n >> w >> h;
string tmp = "";
FOR(i,1,h) {
cin >> tmp;
tmp = ' ' + tmp;
s[i] = tmp;
}
memset(e, -1, sizeof e);
FOR(i,1,h) FOR(j,1,w) FOR(k,1,4) {
dfs(i, j, k);
}
int tst = 0;
FOR(i,1,n) FOR(j,i,n) ++tst, ax[i][j] = tst;
}
void bfs(int dp[mxM][mxM]) {
FOR(tst,0,mxD - 5) {
for (auto& [x, y] : pos[tst]) {
FOR(i,1,4) {
auto& [t1, t2] = e[x][y][i];
if (t1 > 0) xl(dp, t1, t2, tst + 1);
}
}
pos[tst].clear();
}
}
void solve() {
memset(dp, 0x3f, sizeof dp);
FOR(j,1,n) FOD(i,j,1) {
int k = ax[i][j];
if (j == i) {
FOR(x,1,h) FOR(y,1,w) if (s[x][y] == char(j + '0')) xl(dp[k], x, y, 0);
}
else {
FOR(x,1,h) FOR(y,1,w) FOR(l,i,j-1) {
xl(dp[k], x, y, dp[ax[i][l]][x][y] + dp[ax[l+1][j]][x][y]);
}
}
bfs(dp[k]);
}
int res = mxD;
FOR(i,1,h) FOR(j,1,w) res = min(res, dp[ax[1][n]][i][j]);
cout << res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ciin(); solve();
return 0;
}
