#include<bits/stdc++.h>

using namespace std;

const int maxn = 50;
char g[maxn][maxn];
int r, c; 

pair<int, int>operator + (pair<int, int>p1, pair<int, int>p2) {
    auto [x1, y1] = p1;
    auto [x2, y2] = p2;
    return {x1+x2, y1+y2};
};

bool operator < (pair<int, int>p1, pair<int, int>p2) {
    auto [x1, y1] = p1;
    auto [x2, y2] = p2;
    return x1*y2>x2*y1;
}

struct clue {
    int id;
    pair<int, int>st, dir;
    pair<int, int>val;
    bool operator < (const clue &c) {
        if(val<c.val) return true;
        if(c.val<val) return false;
        if(dir!=c.dir) {
            if(dir.second==1) return true;
            else return false;
        }
        return id < c.id;
    }
};

pair<int, int>calc(clue C) {
    int v1 = 0, v2 = 0;
    auto [a, b] = C.st;
    
    int cnt = 0;
    while(a<r and b<c and g[a][b]!='#') {
        ++cnt;
        a += C.dir.first;
        b += C.dir.second;
    }
    tie(a, b) = C.st;

    int now = 0;
    while(a<r and b<c and g[a][b]!='#') {
        if(g[a][b]!='.') {
            v1 += (cnt - now);
        }
        ++now;
        a += C.dir.first;
        b += C.dir.second;
    }
    // cout << "calc id: " << C.id << endl;
    // cout << C.st.first << ' ' << C.st.second << ' ' << C.dir.first << ' ' << C.dir.second << ' ' << v1 << ' ' << cnt << endl;
    return { v1, cnt*(cnt+1)/2 };
}

void update(clue C) {
    auto [a, b] = C.st;
    while(a<r and b<c and g[a][b]!='#') {
        g[a][b] = 'A';
        a += C.dir.first;
        b += C.dir.second;
    }
}

void solve() {
    cin >> r >> c;
    for(int i = 0 ; i < r ; i ++) cin >> g[i];

    vector<clue>vec;

    int tot = 0;
    for(int i = 0 ; i < r ; i ++) {
        for(int j = 0 ; j < c ;j ++) {
            if(g[i][j]=='#') continue;
            
            if(i==0 or g[i-1][j]=='#' or j==0 or g[i][j-1]=='#') {
                ++tot;
                if(i==0 or g[i-1][j] == '#') {
                    vec.push_back({tot, {i, j}, {1, 0}, {0, 0}});
                }
                if(j==0 or g[i][j-1] == '#') {
                    vec.push_back({tot, {i, j}, {0, 1}, {0, 0}});
                }
            }
        }
    }

    int cnt = 0;
    while(vec.size()) {
        // for(int i = 0 ; i < r ; i ++) {
        //     for(int j = 0 ; j < c ; j ++) {
        //         cout << g[i][j];
        //     }
        //     cout << endl;
        // }
        vector<clue>temp;
        for(auto &C: vec) {
            C.val = calc(C);
            if(C.val.first==C.val.second) continue;
            temp.push_back(C);
        }
        sort(begin(temp), end(temp));

        if(temp.size()) {
            auto C = temp[0];
            char ch;
            if(C.dir.first==1) ch = 'D';
            else ch = 'A';
            cout << C.id << ch << '\n';
            update(C);
        }

        swap(vec, temp);
        //exit(0);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    return 0;
}