#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1000000000000000000LL;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T k) {
  return k >= 0 ? k : -k;
}
template <class T>
T sqr(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
T addmod(T a, T b, T c) {
  return (T)mod((long long)a + b, (long long)c);
}
template <class T>
T mulmod(T a, T b, T c) {
  return (T)mod((long long)a * b, (long long)c);
}
template <class T>
T powmod(T a, T b, T c) {
  return (T)(b ? mulmod(mod((T)sqr((long long)powmod(a, b >> 1, c)), c),
                        b & 1 ? a : 1, c)
               : 1);
}
template <class T>
void maxe(T &a, T b) {
  a = max(a, b);
}
template <class T>
void mine(T &a, T b) {
  a = min(a, b);
}
template <class T>
void mode(T &a, T b) {
  a = mod(a, b);
}
template <class T>
void addmode(T &a, T b, T c) {
  a = addmod(a, b, c);
}
template <class T>
void mulmode(T &a, T b, T c) {
  a = mulmod(a, b, c);
}
template <class T>
void powmode(T &a, T b, T c) {
  a = powmod(a, b, c);
}
template <class T>
void getint(T &a) {
  a = 0;
  int b = 1, c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 1111;
int test;
int n, m, k, ans;
char s[N];
int a[N][N], b[N][N];
pair<int, pair<int, int> > p[1111111];
const char ch[] = {'B', 'R', 'D'};
const int dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0};
pair<int, int> st[1111111];
int cnt;
void add(int t, int x, int y) { p[ans++] = make_pair(t, make_pair(x, y)); }
void dfs(int x, int y) {
  add(0, x, y);
  st[++cnt] = make_pair(x, y);
  a[x][y] = 0;
  for (int i = 0; i < 4; i++)
    if (a[x + dx[i]][y + dy[i]]) dfs(x + dx[i], y + dy[i]);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s + 1);
    for (int j = 1; j <= m; j++) a[i][j] = (s[j] == '.');
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (a[i][j]) {
        cnt = 0;
        dfs(i, j);
        for (int i = cnt; i > 1; i--) {
          add(2, st[i].first, st[i].second);
          add(1, st[i].first, st[i].second);
        }
      }
  printf("%d\n", ans);
  for (int i = 0; i < ans; i++)
    printf("%c %d %d\n", ch[p[i].first], p[i].second.first, p[i].second.second);
  return 0;
}
