#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}
inline int add(int a, int b) {
  a += b;
  return a >= 1000000007 ? a - 1000000007 : a;
}
inline int sub(int a, int b) {
  a -= b;
  return a < 0 ? a + 1000000007 : a;
}
inline int mul(int a, int b) { return (long long int)a * b % 1000000007; }
int Set(int N, int pos) { return N = N | (1 << pos); }
int Reset(int N, int pos) { return N = N & ~(1 << pos); }
bool Cheek(int N, int pos) { return (bool)(N & (1 << pos)); }
const int fx[] = {+1, -1, +0, +0};
const int fy[] = {+0, +0, +1, -1};
char grid[505][505];
int n, m, vis[505][505];
vector<pair<int, int> > comp[350009];
void DFS(int x, int y, int fg) {
  vis[x][y] = fg;
  comp[fg].push_back(make_pair(x, y));
  for (int i = 0; i < 4; i++) {
    int nx = x + fx[i];
    int ny = y + fy[i];
    if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && !vis[nx][ny] &&
        grid[nx][ny] == '.') {
      DFS(nx, ny, fg);
    }
  }
}
void Solve(int t) {
  int i, j, k, cnt = 0;
  scanf("%d %d", &(n), &(m));
  for (i = 1; i <= n; i++) {
    getchar();
    for (j = 1; j <= m; j++) {
      scanf("%c", &grid[i][j]);
    }
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (!vis[i][j] && grid[i][j] == '.') DFS(i, j, ++cnt);
    }
  }
  vector<pair<char, pair<int, int> > > ans;
  for (i = 1; i <= cnt; i++) {
    int sz = (int)comp[i].size();
    for (j = 0; j < sz; j++) {
      ans.push_back(
          make_pair('B', make_pair(comp[i][j].first, comp[i][j].second)));
    }
    for (j = sz - 1; j >= 1; j--) {
      ans.push_back(
          make_pair('D', make_pair(comp[i][j].first, comp[i][j].second)));
      ans.push_back(
          make_pair('R', make_pair(comp[i][j].first, comp[i][j].second)));
    }
  }
  printf("%d\n", (int)ans.size());
  for (i = 0; i < (int)ans.size(); i++) {
    printf("%c %d %d\n", ans[i].first, ans[i].second.first,
           ans[i].second.second);
  }
}
int main() {
  int t, T;
  T = 1;
  for (__typeof(t) t = 1; t <= T; t++) {
    Solve(t);
  }
  return 0;
}
