#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 3e5;

int h, w, k;
int dx[] = {0, 1, 1, -1, 1, -1, -1, 0};
int dy[] = {1, 0, 1, 1, -1, -1, 0, -1};

bool valid(int x, int y) {
    return x >= 0 && x < h && y >= 0 && y < w;
}

struct DSU {
    vector<int> sz, par;

    DSU() {
        sz.resize(N);
        par.resize(N);

        for (int i = 0; i < N; i++)
            par[i] = i, sz[i] = 1;
    }

    int findSet(int u) {
        if (u == par[u])
            return u;

        return par[u] = findSet(par[u]);
    }

    void unionSet(int u, int v) {
        u = findSet(u);
        v = findSet(v);

        if (u != v) {
            if (sz[u] < sz[v])
                swap(u, v);

            par[v] = u;
            sz[u] += sz[v];
        }
    }
} dsu[4];

void testCase() {
    cin >> h >> w >> k;

    int cntCol[w], col[h][w];

    memset(col, -1, sizeof col);
    memset(cntCol, 0, sizeof cntCol);

    int newR, newC;
    for (int i = 0, c, r; i < h * w; i++) {
        cin >> c;

        c--;

        r = h - cntCol[c] - 1;

        for (int j = 0; j < 4; j++) {
            newR = r + dx[j], newC = c + dy[j];

            if (valid(newR, newC) && col[newR][newC] == (i & 1))
                dsu[j].unionSet(r * w + c, newR * w + newC);

            newR = r + dx[7 - j], newC = c + dy[7 - j];

            if (valid(newR, newC) && col[newR][newC] == (i & 1))
                dsu[j].unionSet(r * w + c, newR * w + newC);

            if (dsu[j].sz[dsu[j].findSet(r * w + c)] >= k)
                return cout << char('A' + (i & 1)) << ' ' << i + 1, void();
        }

        cntCol[c]++, col[r][c] = i & 1;
    }

    cout << 'D';
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}