#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(char ch) {
  string s;
  s += ch;
  return s;
}
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
void no() {
  cout << "NO\n";
  exit(0);
}
void yes() { cout << "YES\n"; }
int maxn = 500, maxm = 500;
int n, m;
vector<char> color;
vector<int> x, y;
vector<vector<bool> > vis(maxn + 1, vector<bool>(maxm + 1));
vector<vector<char> > grid(maxn + 1, vector<char>(maxm + 1));
vector<vector<bool> > isroot(maxn + 1, vector<bool>(maxm + 1));
void dfs(int r, int c) {
  vis[r][c] = 1;
  color.push_back('B');
  x.push_back(r);
  y.push_back(c);
  for (pair<int, int> dir :
       vector<pair<int, int> >({{-1, 0}, {1, 0}, {0, -1}, {0, 1}})) {
    int newx = r + dir.first, newy = c + dir.second;
    if (newx < n && newx >= 0 && newy < m && newy >= 0) {
      if (!vis[newx][newy] && grid[newx][newy] != '#') {
        dfs(newx, newy);
      }
    }
  }
  if (!isroot[r][c]) {
    color.push_back('D');
    x.push_back(r);
    y.push_back(c);
    color.push_back('R');
    x.push_back(r);
    y.push_back(c);
  }
}
void solve() {
  cin >> n >> m;
  int compo = 0;
  for (int i = (int)0; i < (int)n; i++) {
    for (int j = (int)0; j < (int)m; j++) cin >> grid[i][j];
  }
  for (int i = (int)0; i < (int)n; i++) {
    for (int j = (int)0; j < (int)m; j++) {
      if (!vis[i][j] && grid[i][j] != '#') {
        isroot[i][j] = 1;
        dfs(i, j);
        compo++;
      }
    }
  }
  cout << ((long long)color.size()) << "\n";
  for (int i = (int)0; i < (int)((long long)color.size()); i++) {
    cout << color[i] << " " << x[i] + 1 << " " << y[i] + 1 << "\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int tc = 1; tc <= t; tc++) {
    solve();
  }
}
