#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int MAX = 5e2 + 5;
const long long MAX2 = 11;
const long long MOD = 1000000007;
const long long MOD2 = 2010405347;
const long long INF = 2e18;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
const double pi = acos(-1);
const double EPS = 1e-9;
const int block = 555;
int n, m, vis[MAX][MAX], r, c, nr, nc, cnt, mx;
char x[MAX][MAX];
queue<pair<int, int> > q;
vector<pair<int, int> > v[MAX * MAX];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  memset(x, '#', sizeof x);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) cin >> x[i][j];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (x[i][j] == '.') {
        x[i][j] = '#';
        q.push({i, j});
        while (!q.empty()) {
          r = q.front().first, c = q.front().second, q.pop();
          v[vis[r][c]].push_back({r, c});
          for (int k = 0; k <= 3; ++k) {
            nr = r + dr[k], nc = c + dc[k];
            if (x[nr][nc] == '.') {
              x[nr][nc] = '#';
              vis[nr][nc] = vis[r][c] + 1;
              q.push({nr, nc});
            }
          }
        }
      }
  n *= m;
  for (int i = n; i >= 0; --i)
    if (!v[i].empty()) {
      mx = i;
      break;
    }
  for (int i = 0; i <= mx; ++i) {
    cnt += v[i].size();
    if (i != 0 && i != mx) cnt += v[i].size() * 2;
  }
  cout << cnt << '\n';
  if (mx == 0) {
    for (pair<int, int> i : v[0])
      cout << "B " << i.first << ' ' << i.second << '\n';
  } else {
    for (int i = mx - 1; i >= 0; --i) {
      for (pair<int, int> j : v[i])
        cout << "B " << j.first << ' ' << j.second << '\n';
      for (pair<int, int> j : v[i + 1])
        cout << "R " << j.first << ' ' << j.second << '\n';
      if (i)
        for (pair<int, int> j : v[i])
          cout << "D " << j.first << ' ' << j.second << '\n';
    }
  }
  return 0;
}
