#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;

constexpr int dx[] = {1, 0, -1, 0};
constexpr int dy[] = {0, 1, 0, -1};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int r, c;
    std::cin >> r >> c;
    
    std::vector<std::string> s(r);
    for (int i = 0; i < r; i++) {
        std::cin >> s[i];
    }
    
    int len = 0;
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            if (s[i][j] != '.' && s[i][j] != 'A') {
                len++;
            }
        }
    }
    
    std::vector<int> a(len);
    
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            if (s[i][j] != '.' && s[i][j] != 'A') {
                char ch = s[i][j];
                int x = std::isdigit(ch) ? ch - '0' : ch - 'a' + 10;
                a[x] = i * c + j;
            }
        }
    }
    
    std::queue<std::vector<int>> q;
    q.push(a);
    
    while (!q.empty()) {
        auto a = q.front();
        q.pop();
        
        std::vector b(r, std::vector<bool>(c)), vis(r, std::vector<bool>(c));
        for (auto i : a) {
            int x = i / c;
            int y = i % c;
            b[x][y] = true;
        }
        int x = a[0] / c, y = a[0] % c;
        {
            std::queue<std::array<int, 2>> q;
            vis[x][y] = true;
            q.push({x, y});
            while (!q.empty()) {
                auto [x, y] = q.front();
                q.pop();
                
                if (s[x][y] == 'A') {
                    std::cout << "1\n";
                    return 0;
                }
                
                for (int k = 0; k < 4; k++) {
                    int nx = x + dx[k];
                    int ny = y + dy[k];
                    if (0 <= nx && nx < r && 0 <= ny && ny < c && !b[nx][ny] && !vis[nx][ny]) {
                        vis[nx][ny] = true;
                        q.push({nx, ny});
                    }
                }
            }
        }
        
        for (int k = 0; k < 4; k++) {
            int nx = x + dx[k];
            int ny = y + dy[k];
            if (0 <= nx && nx < r && 0 <= ny && ny < c && std::find(a.begin(), a.begin() + std::max(2, len - 1), nx * c + ny) == a.begin() + std::max(2, len - 1)) {
                auto b = a;
                b.pop_back();
                b.insert(b.begin(), nx * c + ny);
                q.push(b);
            }
        }
    }
    
    std::cout << "0\n";
    
    return 0;
}