#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
#include <limits.h>//INT_MAX
#include <math.h>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>
#include <fstream>
#include <array>
#include <bit>
#include <chrono>
#include <ranges>
#include <span>
#include <cmath>
#include <cstdint>
#include <complex>//複素数
//#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template < typename T > std::string to_string( const T& n ){std::ostringstream stm ;stm << n ;return stm.str() ;}
int RandInt(int L,int R){
    return rand()%(R-L+1)+L;
}
int N,M;
vector<string> A;
vector<string> moto_A;
vector<pair<int,vector<pair<int,int>>>> bomb;

vector<pair<int,int>>tatemono;
vector<pair<int,int>>bakudanya;
vector<int>bakuha_zahyo;
int max_cnt_num=1;
int max_cnt=0;
int min_cost_num=1;
int min_cost=1<<30;
int bakudan_cnt=0;
void input(){
    cin>>N>>M;
    A.resize(N);
    moto_A.resize(N);
    for(int i=0; i<N; i++){
        cin>>A[i];
        moto_A[i]=A[i];
    }
    bomb.resize(M);
    for(int i=0; i<M; i++){
        int C,L;
        cin>>C>>L;
        bomb[i].first=C;//first:Cost 
        if(min_cost>C){
            min_cost=C;
            min_cost_num=i+1;
        }
        if(max_cnt<L){
            max_cnt=L;
            max_cnt_num=i+1;
        }
        for(int j=0; j<L; j++){
            int a,b;
            cin>>a>>b;
            bomb[i].second.push_back(make_pair(a,b));//second.first:壊せるマスのiからのx方向距離 second.second: y方向距離 
        }
    }
}
void bakuha(int i,int j,int num){
    num--;
    //cerr<<bomb[num].second.size()<<" ";
    rep(ni,bomb[num].second.size()){
        int x=i+bomb[num].second[ni].first;
        int y=j+bomb[num].second[ni].second;
        //cerr<<x<<" "<<y<<endl;
        if(x<0||x>=N||y<0||y>=N)continue;
        //cerr<<"a";
        A[x][y]='.';
    }
}
void mukau(int sx,int sy,int gx,int gy,vector<pair<int,string>> &ans){
    if(sx<gx){
        rep(i,gx-sx)ans.push_back(make_pair(1,"D"));
    }
    if(gx<sx){
        rep(i,sx-gx)ans.push_back(make_pair(1,"U"));
    }
    if(sy<gy){
        rep(j,gy-sy)ans.push_back(make_pair(1,"R"));
    }
    if(gy<sy){
        rep(j,sy-gy)ans.push_back(make_pair(1,"L"));
    }
}
//建物を爆破できるいちばん近い場所に移動する
pair<int,int> ido(int nowx,int nowy,int bakuhax,int bakuhay,int num){
    num--;
    int kyori=2500;
    int gx=10000;
    int gy=10000;
    rep(ni,bomb[num].second.size()){
        int x=bakuhax-bomb[num].second[ni].first;
        int y=bakuhay-bomb[num].second[ni].second;
        //cerr<<x<<" "<<y<<endl;
        if(x<0||x>=N||y<0||y>=N)continue;
        if(abs(x-nowx)+abs(y-nowy)<kyori){
            gx=x;
            gy=y;
            kyori=abs(x-nowx)+abs(y-nowy);
        }
    }    
    //cerr<<nowx<<" "<<nowy<<" "<<gx<<" "<<gy<<endl;
    return make_pair(gx,gy);
}
void kesu(vector<int>&bakuha_zahyo,int num){
    num--;
    vector<int>iranai(bakuha_zahyo.size(),0);
    vector<vector<int>>masu(N,vector<int>(N,0));
    rep(nj,bakuha_zahyo.size()){
        int i=bakuha_zahyo[nj]/N;
        int j=bakuha_zahyo[nj]%N;
        rep(ni,bomb[num].second.size()){
            int x=i+bomb[num].second[ni].first;
            int y=j+bomb[num].second[ni].second;
            if(x<0||x>=N||y<0||y>=N)continue;
            masu[x][y]++;
        }        
    }
    rep(nj,bakuha_zahyo.size()){
        int i=bakuha_zahyo[nj]/N;
        int j=bakuha_zahyo[nj]%N;
        bool hantei=true;
        rep(ni,bomb[num].second.size()){
            int x=i+bomb[num].second[ni].first;
            int y=j+bomb[num].second[ni].second;
            if(x<0||x>=N||y<0||y>=N)continue;
            if(masu[x][y]<=1&&moto_A[x][y]!='.')hantei=false;
        }        
        if(hantei){
            iranai[nj]=1;
            rep(ni,bomb[num].second.size()){
                int x=i+bomb[num].second[ni].first;
                int y=j+bomb[num].second[ni].second;
                if(x<0||x>=N||y<0||y>=N)continue;
                masu[x][y]--;
            }
        }
    } 
    vector<int>iru;
    rep(i,bakuha_zahyo.size()){
        if(iranai[i]==0){
            iru.push_back(bakuha_zahyo[i]);   
        }else{
            bakudan_cnt--;
        }
    }
    bakuha_zahyo=iru;
}

int main(){
    int TIMELIMIT=1.5*CLOCKS_PER_SEC;
    int ti=clock();
    vector<pair<int,string>> ans;
    //vector<pair<int,string>> ans_yamanobori;
    input();
    int kind=max_cnt_num;
    //int kind=min_cost_num;
    cerr<<min_cost_num<<" "<<max_cnt_num<<endl;    
    int building_cnt=0;
    rep(i,N)rep(j,N){
        if(A[i][j]=='#')tatemono.emplace_back(i,j);
        if(A[i][j]=='@')bakudanya.emplace_back(i,j);
    }
    int x=bakudanya[0].first;
    int y=bakudanya[0].second;
    //爆弾のある地点に行く

    mukau(0,0,x,y,ans);
    //mukau(0,0,x,y,ans_yamanobori);
    ans.push_back(make_pair(2,to_string(kind)));//爆弾を買う
    //ans_yamanobori.push_back(make_pair(2,to_string(kind)));//爆弾を買う
    
    mukau(x,y,N/2,N/2,ans);
    ans.push_back(make_pair(3,to_string(kind)));
    bakudan_cnt++;
    x=N/2;y=N/2;
    bakuha(x,y,kind);
    
    //建物のある地点に行く
    int x_keep=x,y_keep=y;
    rep(i,N)rep(j,N){
        int nx=i;
        int ny=j;
        if(A[nx][ny]=='#'||A[nx][ny]=='@'){
            pair<int,int>p=ido(x,y,nx,ny,kind);
            int ni=p.first;
            int nj=p.second;
            //if(nx<0||nx>=N||ny<0||ny>=N)continue;
            bakuha_zahyo.emplace_back(ni*N+nj);
            //mukau(x,y,ni,nj,ans);
            x=ni;y=nj;
            bakudan_cnt++;
            //ans.push_back(make_pair(3,to_string(kind)));
            //cerr<<x<<" "<<y<<endl;
            bakuha(x,y,kind);
        }
    }
    //いらないも爆破をやめる
    kesu(bakuha_zahyo,kind);
    
    int kyori_best=1<<30;
    while(clock()-ti<TIMELIMIT){
        int r=RandInt(0,bakuha_zahyo.size()-1);
        int r2=RandInt(0,bakuha_zahyo.size()-1);
        while(r==r2)r2=RandInt(0,bakuha_zahyo.size()-1);
        int kyori=abs(x_keep-bakuha_zahyo[0]/N)+abs(y_keep-bakuha_zahyo[0]%N);
        int old=bakuha_zahyo[r];
        bakuha_zahyo[r]=bakuha_zahyo[r2];
        bakuha_zahyo[r2]=old;
        rep(i,bakuha_zahyo.size()-1){
            int ni=bakuha_zahyo[i]/N;
            int nj=bakuha_zahyo[i]%N;
            int ni1=bakuha_zahyo[i+1]/N;
            int nj1=bakuha_zahyo[i+1]%N;
            kyori+=abs(ni-ni1)+abs(nj-nj1);
        }
        if(kyori<kyori_best){
            kyori_best=kyori;
            cerr<<kyori<<endl;
        }else{
            bakuha_zahyo[r2]=bakuha_zahyo[r];
            bakuha_zahyo[r]=old;
        }
    }
    
    x=x_keep;
    y=y_keep;
    rep(i,bakuha_zahyo.size()){
        int ni=bakuha_zahyo[i]/N;
        int nj=bakuha_zahyo[i]%N;
        mukau(x,y,ni,nj,ans);
        x=ni;y=nj;
        ans.push_back(make_pair(3,to_string(kind)));
    }
    cout<<ans.size()+bakudan_cnt-1<<endl;
    for(pair<int,string> i:ans){
        if(i.first==2){
            rep(j,bakudan_cnt)cout<<i.first<<" "<<i.second<<endl;

        }else{
            cout<<i.first<<" "<<i.second<<endl;
        }
    }
}