Problem: After too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid with n rows and m columns (it contains n × m cells). The goal of the game is to build your own city. Some cells in the grid are big holes, where Iahub can't build any building. The rest of cells are empty. In some empty cell Iahub can build exactly one tower of two following types:

  1. Blue towers. Each has population limit equal to 100. 
  2. Red towers. Each has population limit equal to 200. However, it can be built in some cell only if in that moment at least one of the neighbouring cells has a Blue Tower. Two cells are neighbours is they share a side. 



Iahub is also allowed to destroy a building from any cell. He can do this operation as much as he wants. After destroying a building, the other buildings are not influenced, and the destroyed cell becomes empty (so Iahub can build a tower in this cell if needed, see the second example for such a case).

Iahub can convince as many population as he wants to come into his city. So he needs to configure his city to allow maximum population possible. Therefore he should find a sequence of operations that builds the city in an optimal way, so that total population limit is as large as possible.

He says he's the best at this game, but he doesn't have the optimal solution. Write a program that calculates the optimal one, to show him that he's not as good as he thinks. 

Input

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 500). Each of the next n lines contains m characters, describing the grid. The j-th character in the i-th line is '.' if you're allowed to build at the cell with coordinates (i, j) a tower (empty cell) or '#' if there is a big hole there. 

Output

Print an integer k in the first line (0 ≤ k ≤ 106) — the number of operations Iahub should perform to obtain optimal result.

Each of the following k lines must contain a single operation in the following format:

  1. «B x y» (1 ≤ x ≤ n, 1 ≤ y ≤ m) — building a blue tower at the cell (x, y); 
  2. «R x y» (1 ≤ x ≤ n, 1 ≤ y ≤ m) — building a red tower at the cell (x, y); 
  3. «D x y» (1 ≤ x ≤ n, 1 ≤ y ≤ m) — destroying a tower at the cell (x, y). 



If there are multiple solutions you can output any of them. Note, that you shouldn't minimize the number of operations.

Examples

Input

2 3
..#
.#.


Output

4
B 1 1
R 1 2
R 2 1
B 2 3


Input

1 3
...


Output

5
B 1 1
B 1 2
R 1 3
D 1 2
R 1 2

Solution (in JAVA):

Solution:
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.concurrent.*;

public class P327D {

  final static int X = 0;
  final static int Y = 1;
  final static char BLUE = 'B';
  final static char RED = 'R';
  final static char DESTROY = 'D';
  final static char POINT = '.';
  final static char USED = '#';
  final static int [][] DXY = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

  @SuppressWarnings("unchecked")
  public void run() throws Exception {
    int n = nextInt();
    int m = nextInt();
    char [][] f = new char [n][];
    for (int i = 0; i < n; i++) {
      f[i] = next().toCharArray();
    }

    int count = 0;
    StringBuffer sb = new StringBuffer();

    for (int y = 0; y < n; y++) {
      for (int x = 0; x < m; x++) {
        if (f[y][x] == POINT) {
          ArrayList<int []> fxy = new ArrayList();
          ArrayDeque<int []> xy = new ArrayDeque();
          xy.addLast(new int [] {x, y});
          fxy.add(xy.peekLast());
          f[y][x] = USED;
      
          while (xy.size() > 0) {
            int [] cxy = xy.pollFirst();
      
            for (int [] dxy : DXY) {
              int [] nxy = new int [] {cxy[X] + dxy[X], cxy[Y] + dxy[Y]};
              
              if ((nxy[X] >= 0) && (nxy[X] < m) &&
                  (nxy[Y] >= 0) && (nxy[Y] < n) &&
                  (f[nxy[Y]][nxy[X]] == POINT)) {
                xy.addLast(nxy);
                fxy.add(nxy);
                f[nxy[Y]][nxy[X]] = USED;
              }
            }
          }

          for (int i = 0; i < fxy.size(); i++) {
            sb = sb.append(BLUE).append(' ').append(fxy.get(i)[Y] + 1).append(' ').append(fxy.get(i)[X] + 1).append('\n');
            count++;
          }

          for (int i = fxy.size() - 1; i > 0; i--) {
            sb = sb.append(DESTROY).append(' ').append(fxy.get(i)[Y] + 1).append(' ').append(fxy.get(i)[X] + 1).append('\n');
            sb = sb.append(RED).append(' ').append(fxy.get(i)[Y] + 1).append(' ').append(fxy.get(i)[X] + 1).append('\n');
            count += 2;
          }
        }
      }
    }

    println(count);
    println(sb);
  }

  public static void main(String... args) throws Exception {
    br = new BufferedReader(new InputStreamReader(System.in));
    pw = new PrintWriter(new BufferedOutputStream(System.out));
    new P327D().run();
    br.close();
    pw.close();
  }

  static BufferedReader br;
  static PrintWriter pw;
  StringTokenizer stok;

  String nextToken() throws IOException {
    while (stok == null || !stok.hasMoreTokens()) {
      String s = br.readLine();
      if (s == null) { return null; }
      stok = new StringTokenizer(s);
    }
    return stok.nextToken();
  }

  void print(byte b) { print("" + b); }
  void print(int i) { print("" + i); }
  void print(long l) { print("" + l); }
  void print(double d) { print("" + d); }
  void print(char c) { print("" + c); }
  void print(Object o) {
    if (o instanceof int[]) { print(Arrays.toString((int [])o));
    } else if (o instanceof long[]) { print(Arrays.toString((long [])o));
    } else if (o instanceof char[]) { print(Arrays.toString((char [])o));
    } else if (o instanceof byte[]) { print(Arrays.toString((byte [])o));
    } else if (o instanceof short[]) { print(Arrays.toString((short [])o));
    } else if (o instanceof boolean[]) { print(Arrays.toString((boolean [])o));
    } else if (o instanceof float[]) { print(Arrays.toString((float [])o));
    } else if (o instanceof double[]) { print(Arrays.toString((double [])o));
    } else if (o instanceof Object[]) { print(Arrays.toString((Object [])o));
    } else { print("" + o); }
  }
  void print(String s) { pw.print(s); }
  void println() { println(""); }
  void println(byte b) { println("" + b); }
  void println(int i) { println("" + i); }
  void println(long l) { println("" + l); }
  void println(double d) { println("" + d); }
  void println(char c) { println("" + c); }
  void println(Object o) { print(o); println(); }
  void println(String s) { pw.println(s); }
  int nextInt() throws IOException { return Integer.parseInt(nextToken()); }
  long nextLong() throws IOException { return Long.parseLong(nextToken()); }
  double nextDouble() throws IOException { return Double.parseDouble(nextToken()); }
  char nextChar() throws IOException { return (char) (br.read()); }
  String next() throws IOException { return nextToken(); }
  String nextLine() throws IOException { return br.readLine(); }
  int [] readInt(int size) throws IOException {
    int [] array = new int [size];
    for (int i = 0; i < size; i++) { array[i] = nextInt(); }
    return array;
  }
  long [] readLong(int size) throws IOException {
    long [] array = new long [size];
    for (int i = 0; i < size; i++) { array[i] = nextLong(); }
    return array;
  }
  double [] readDouble(int size) throws IOException {
    double [] array = new double [size];
    for (int i = 0; i < size; i++) { array[i] = nextDouble(); }
    return array;
  }
  String [] readLines(int size) throws IOException {
    String [] array = new String [size];
    for (int i = 0; i < size; i++) { array[i] = nextLine(); }
    return array;
  }
}