#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#include <regex>

using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep2(i,a,b) for(int i=(a);i<(int)(b);++i)
#define rrep(i,n) for(int i=(n)-1;i>=0;--i)
#define rrep2(i,a,b) for(int i=(a)-1;i>=(int)b;--i)
#define range(i,a,b,c) for(int i=a;c>0?i<b:i>b;i+=c)

#define chmax(a,b) (a=(a)<(b)?(b):(a))
#define chmin(a,b) (a=(a)>(b)?(b):(a))

//template<typename T>void out(T a) {T b=a;if(a==inf)b=-1;cout<<a<<endl;}
//#define out(a) cout<<(a)<<endl
//#define o2(a,b) cout<<(a)<<" ";out(b)
//#define o3(a,b,c) cout<<(a)<<" ";o2(b, c)
#define abp(o,a,b) out(((o)?a:b))
#define YEP(x) abp(x,"YES","NO")
#define Yep(x) abp(x,"Yes","No")


using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a),end(a)
#define ifnot(a) if(!(a))
#define int long long

#ifdef LOCAL_ENV

#if TEST_MODE==true
const bool test = true;
#define dump(x) cerr<<#x<<" : "<<(x)<< " "
#define dumpl(x) dump(x)<<endl
#define cerr_endl cerr<<endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#define cerr_endl 
#endif

#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
const int inf = (int)1 << 60;
const int undefined = inf;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real& r) { return(r > eps) - (r < -eps); }
int sgn(const Real& a, const Real& b) { return sgn(a - b); }

const int MAX = (int)2e6 + 5;
const int MAX2 = 2005;

vector<string> split(const string& str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) v.push_back(buffer); return v; }

string join(const vector<string>& v, const string delim = 0) { string s; if (!v.empty()) { s += v[0]; for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) { if (delim != "")s += delim; s += v[i]; } }return s; }

string operator*(const string& s, const int& n) { string res = ""; rep(i, n)res += s; return res; }

#define sum_f(a){return accumulate(all(a),0ll);}

template<typename T>T gcd(T a, T b) { T c; while (a != 0) { c = a; a = b % a; b = c; }; return b; }
template<typename T>T bit_count(T N) { T c = 0; while (N) { if (N & 1)c++; N >>= 1; }return c; }

template<typename T>void print_vec(vector<T> a, ostream& o = cout) { rep(i, a.size() - 1)o << a[i] << " "; o << a.back() << endl; }

ll pow_n(ll x, ll n) { ll r = 1; while (n > 0) { if (n & 1)r = r * x; x = x * x; n >>= 1; }return r; }

int H, W;

#define grid_ng(y,x) (y<0||y>=H||x<0||x>=W)

int div_ceil(int a, int b) { int r = a / b; if (a % b != 0)r++; return r; }


#define i1(a) cin>>a;
#define i2(a,b) cin>>a>>b;
#define i3(a,b,c) cin>>a;i2(b,c);
#define i4(a,b,c,d) cin>>a;i3(b,c,d);
#define i5(a,b,c,d,e) cin>>a;i4(b,c,d,e);

int cx = 0, cy = 0;

void changeXY(char c) {
	if (c == 'U') cy = cy + 1;
	else if (c == 'D') cy = cy - 1;
	else if (c == 'R') cx = cx + 1;
	else cx = cx - 1;
}

template<typename T>
void in_vec(vector<T>& a, int n) {
	a.resize(n);
	rep(i, n) cin >> a[i];
}

template<typename T>
void in_vec(vector<vector<T>>& a) {
	a.resize(H);
	rep(i, H) {
		a[i].resize(W);
		rep(j, W) cin >> a[i][j];
	}
}

template<typename First>
void out(First first) {
	cout << first << endl;
}

template<typename First, typename... Rest>
void out(First first, Rest... rest) {
	cout << first << " ";
	out(rest...);
}

template<class T, size_t n, size_t idx = 0>
auto make_vec(const size_t(&d)[n], const T& init) noexcept {
	if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));
	else return init;
}

template<class T, size_t n>
auto make_vec(const size_t(&d)[n]) noexcept {
	return make_vec(d, T{});
}


// end template

bool is_bit_on(int b, int i) {
	return (b >> i) & 1;
}


signed main() {
  int N, M;
  cin >> N >> M;
  vector<string> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  vector<pair<int, vector<pair<int, int>>>> bomb(M);
  for (int i = 0; i < M; i++) {
    int C, L;
    cin >> C >> L;
    bomb[i].first = C;
    for (int j = 0; j < L; j++) {
      int a, b;
      cin >> a >> b;
      bomb[i].second.push_back(make_pair(a, b));
    }
  }
  int x = -1, y = -1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      if (A[i][j] == '@') {
        x = i;
        y = j;
        break;
      }
    }
    if (x != -1)break;
  }
  vector<pair<int, string>> ans;
  for (int i = 0; i < x; i++) {
    ans.push_back(make_pair(1, "D"));
  }
  for (int i = 0; i < y; i++) {
    ans.push_back(make_pair(1, "R"));
  }
  for (int i = 0; i < N * N; i++) {
    ans.push_back(make_pair(2, to_string(1)));
  }
  for (int i = 0; i < x; i++) {
    ans.push_back(make_pair(1, "U"));
  }
  for (int i = 0; i < y; i++) {
    ans.push_back(make_pair(1, "L"));
  }
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      ans.push_back(make_pair(3, to_string(1)));
      if (i == N - 1 && j == N - 1)break;
      else if (j == N - 1)ans.push_back(make_pair(1, "D"));
      else if (i % 2 == 0)ans.push_back(make_pair(1, "R"));
      else ans.push_back(make_pair(1, "L"));
    }
  }
  cout << ans.size() << endl;
  for (pair<int, string> i : ans) {
    cout << i.first << " " << i.second << endl;
  }
}