#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){

}
signed main(){
    int n,k;
    cin>>n>>k;
    if(n == 4){
        cout<<1<<endl;
        cout<<'I'<<' '<<1<<' '<<1<<endl;
        return 0;
    }
    vector<string> vs(k);

    for(int i=0;i<k;i++)cin>>vs[i];
    vs.push_back("#");
    int hp = -1;
    for(int i=0;i<vs.size();i++){
        for(int j=0;j<vs[i].size();j++){
            if(vs[i][j] == '#'){
                hp = j+1;
                break;
            }
        }
        if(~hp)break;
    }
    if(hp>n-3)hp = n-3;
    cout<<n<<endl;
    cout<<'I'<<' '<<1<<' '<<hp<<endl;
    cout<<'O'<<' '<<0<<' '<<hp+1<<endl;
    int mid = hp+2;
    while(mid+3<=n){
        cout<<'Z'<<' '<<0<<' '<<mid+1<<endl;
        cout<<'Z'<<' '<<0<<' '<<mid<<endl;
        mid+=2;
    }
    if(mid+1 == n){
        cout<<'L'<<' '<<2<<' '<<n-1<<endl;
    }
    else {
        cout<<'T'<<' '<<1<<' '<<n-1<<endl;
        cout<<'T'<<' '<<0<<' '<<n-2<<endl;
    }
    mid = hp+1;
    while(mid-3>0){
        cout<<'S'<<' '<<0<<' '<<mid-3<<endl;
        cout<<'S'<<' '<<0<<' '<<mid-2<<endl;
        mid-=2;
    }
    if(mid == 2){
        cout<<'J'<<' '<<2<<' '<<1<<endl;
    }
    else {
        cout<<'T'<<' '<<3<<' '<<1<<endl;
        cout<<'T'<<' '<<0<<' '<<1<<endl;
    }
}