#include <bits/stdc++.h>
using namespace std;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define N 1007

char s[N];

struct node {
    char c; 
    int rot, pos;
};

vector<node> res;

inline void print() {
    printf("%d\n", (int)res.size());
    for (auto i : res) printf("%c %d %d\n", i.c, i.rot, i.pos);
}

int main() {
    int w = rd(), h = rd(), pos = 0;
    for (int i = 1; i <= h; ++i) {
        scanf("%s", s + 1);
        for (int j = 1; j <= w; ++j) 
            if (s[j] == '#') pos = j;
        if (pos) break; 
    }
    if (!pos) pos = 1;
    pos = min(pos, w - 3);
    res.push_back((node){'I', 1, pos});
    if (w == 4) {print(); return 0;}

    res.push_back((node){'O', 0, pos + 1});
    // bottom, left, and right
    for (int i = pos - 2; i > 0; i -= 2) res.push_back((node){'S', 0, i});
    for (int i = pos + 3; i + 2 <= w; i += 2) res.push_back((node){'Z', 0, i});

    if (pos != 1) res.push_back((node){'T', 3, 1});
    if (pos + 3 != w) res.push_back((node){'T', 1, w - 1});


    int i;
    for (i = pos + 4; i + 2 <= w; i += 2);
    i -= 2;
    for (; i >= pos + 4; i -= 2) res.push_back((node){'S', 0, i});
    for (i = pos - 3; i > 0; i -= 2);
    i += 2;
    for (; i <= pos - 3; i += 2) res.push_back((node){'Z', 0, i});
    
    if (pos != 1) res.push_back((node){'T', 0, pos - 1});
    else res.push_back((node){'J', 2, 1});

    if (pos + 3 != w) res.push_back((node){'T', 0, pos + 2});
    else res.push_back((node){'L', 2, pos + 2});
    
    print();
    return 0;
}