#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T n) {
  return (n < 0 ? -n : n);
}
template <typename T>
inline T sqr(T n) {
  return (n * n);
}
int n, m, a[510][510];
char c;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
bool ok(int first, int second) {
  return (first >= 0 && first < n && second >= 0 && second < m);
}
bool have_around(int first, int second, int val) {
  for (int i = 0; i < 4; i++) {
    int t_x = first + dx[i];
    int t_y = second + dy[i];
    if (ok(t_x, t_y) && a[t_x][t_y] == val) return true;
  }
  return false;
}
char ans_c[500 * 500 * 4];
int ans_x[500 * 500 * 4];
int ans_y[500 * 500 * 4];
int ans;
void make(char c, int first, int second) {
  ans_c[ans] = c;
  ans_x[ans] = first;
  ans_y[ans] = second;
  ans++;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    getchar();
    for (int j = 0; j < m; j++) {
      c = getchar();
      if (c == '#') a[i][j] = -1;
    }
  }
  queue<pair<int, int> > q;
  stack<pair<int, int> > st;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == 0) {
        q.push(make_pair(i, j));
        a[i][j] = 1;
        make('B', i + 1, j + 1);
        while (!q.empty()) {
          pair<int, int> cur = q.front();
          q.pop();
          st.push(cur);
          for (int k = 0; k < 4; k++) {
            pair<int, int> tmp(cur);
            tmp.first += dx[k];
            tmp.second += dy[k];
            if (ok(tmp.first, tmp.second) && a[tmp.first][tmp.second] == 0) {
              a[tmp.first][tmp.second] = 1;
              q.push(tmp);
              make('B', tmp.first + 1, tmp.second + 1);
            }
          }
        }
        while (!st.empty()) {
          pair<int, int> cur = st.top();
          st.pop();
          if (have_around(cur.first, cur.second, 1)) {
            make('D', cur.first + 1, cur.second + 1);
            make('R', cur.first + 1, cur.second + 1);
            a[cur.first][cur.second] = 2;
          }
        }
      }
    }
  }
  printf("%d\n", ans);
  for (int i = 0; i < ans; i++)
    printf("%c %d %d\n", ans_c[i], ans_x[i], ans_y[i]);
  return 0;
}
