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

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;
}

inline bool getmin(int &a, int b) {return (a > b ? (a = b, true) : false);}
inline bool getmax(int &a, int b) {return (a < b ? (a = b, true) : false);}

constexpr int N = 20007;
constexpr int M = 300007;
constexpr int inf = 1e9;

char res[N]; int restot;

// F is the type of flow
template<const int V, const int E, class F, const F flowInf>
struct Flow {

    int tot = 1, S, T, hd[V], cur[V], dis[V];
    struct edge{int to, nxt; F cap; char ty;} e[E << 1];

    void clear() {tot = 1; memset(hd, 0, sizeof(hd));}

    void add(int u, int v, F w, char ty) {
        //printf("%d %d %d %c\n", u, v, w, ty);
        e[++tot].nxt = hd[u], hd[u] = tot, e[tot].to = v, e[tot].cap = w, e[tot].ty = ty;
        e[++tot].nxt = hd[v], hd[v] = tot, e[tot].to = u, e[tot].cap = 0, e[tot].ty = ty;
    }

    inline bool bfs() {
        static int q[V], qhd, qtl; 
        memcpy(cur, hd, sizeof(hd));
        memset(dis, -1, sizeof(dis));
        q[qhd = qtl = 1] = S; dis[S] = 0;
        while (qhd <= qtl) {
            int u = q[qhd++];
            for (int i = hd[u], v; i; i = e[i].nxt)
                if (dis[v = e[i].to] == -1 && e[i].cap != 0) {
                    dis[v] = dis[u] + 1; q[++qtl] = v;
                }
        }
        return dis[T] != -1;
    }

    F dfs(int u, F rem) {
        if (u == T) return rem;
        F flow = 0;
        for (int i = cur[u], v; i && rem; i = e[i].nxt) {
            cur[u] = i; v = e[i].to;
            F nw = min(rem, e[i].cap);
            if (nw != 0 && dis[v] == dis[u] + 1) {
                int ret = dfs(v, nw);
                flow += ret; rem -= ret; 
                e[i].cap -= ret; e[i ^ 1].cap += ret;
            }
        }
        if (flow == 0) dis[u] = -1;
        return flow;
    }

    F dinic(int source, int sink) {
        S = source; T = sink; F flow = 0;
        while (bfs()) flow += dfs(S, flowInf);
        return flow;
    }

    int find(int u) {
        for (int i = hd[u], v; i; i = e[i].nxt)
            if (!(i & 1) && !e[i].cap) {
                if ((v = e[i].to) == T) return u;
                if (e[i].ty != ' ') res[++restot] = e[i].ty;
                return find(v);
            }
        return 0;
    }
};

Flow<N, M, int, inf> f;

int n, a, b, bs, sx[N], sy[N], tx[N], ty[N];

inline int idi(int x, int y, int t) {return (x - 1) * b + y + bs * t;}
inline int ido(int x, int y, int t) {return (x - 1) * b + y + a * b + bs * t;}

inline bool valid(int t) {
    f.clear();
    int S = 0, T = N - 1;
    int used = ido(a, b, t);
    for (int i = 1; i <= n; ++i) f.add(used + i, T, 1, ' ');
    for (int i = 1; i <= n; ++i) f.add(S, idi(sx[i], sy[i], 0), 1, ' ');
    for (int s = 0; s <= t; ++s) {
        for (int i = 1; i <= a; ++i)
            for (int j = 1; j <= b; ++j) {
                f.add(idi(i, j, s), ido(i, j, s), 1, ' ');
                if (s < t) {
                    f.add(ido(i, j, s), idi(i, j, s + 1), 1, 'S');
                    if (i != 1) f.add(ido(i, j, s), idi(i - 1, j, s + 1), 1, 'U');
                    if (i != a) f.add(ido(i, j, s), idi(i + 1, j, s + 1), 1, 'D');
                    if (j != 1) f.add(ido(i, j, s), idi(i, j - 1, s + 1), 1, 'L');
                    if (j != b) f.add(ido(i, j, s), idi(i, j + 1, s + 1), 1, 'R');
                }
            }
        for (int i = 1; i <= n; ++i) 
            f.add(ido(tx[i], ty[i], s), used + i, 1, ' ');
    }
    return f.dinic(S, T) == n;
}

int main() {
    n = rd();
    a = rd(), b = rd();
    bs = a * b * 2;
    for (int i = 1; i <= n; ++i) {sx[i] = rd(); sy[i] = rd();}
    for (int i = 1; i <= n; ++i) {tx[i] = rd(); ty[i] = rd();}
    int l = 0, r = a * b;
    while (l < r) {
        int mid = (l + r) / 2;
        valid(mid) ? r = mid : l = mid + 1;
    }
    valid(l);
    printf("%d\n", l); 
    for (int i = 1; i <= n; ++i) {
        restot = 0;
        int tar = f.find(idi(sx[i], sy[i], 0)) - ido(a, b, l); 
        printf("%d %d %d %d ", sx[i], sy[i], tx[tar], ty[tar]);
        for (int len = 1; len <= restot; ++len) putchar(res[len]);
        for (int len = l - restot; len; --len) putchar('P'); puts("");
    }
    return 0;
}