#include<cstdio>
#include<cstdlib>
#define lg(x) (31-__builtin_clz(x))
#define llg(x) (63-__builtin_clzll(x))
const int N=114,P=100086,MOD=998244353,INF=1e9+7;
int n,a,b,qh,qt,s,t,tot,ax,ay;
int px[N],py[N],qx[N],qy[N],d[P],h[P],fir[P],q[P];
int xx[4]={-1,0,1,0},
    yy[4]={0,-1,0,1};
char ansl[N*3];
struct edge{int v,w,nxt;}e[5000086];
int Abs(int x){return x<0?-x:x;}
int lowbit(int x){return x&(-x);}
int Max(int a,int b){return a>b?a:b;}
int Min(int a,int b){return a<b?a:b;}
int Swap(int &a,int &b){a^=b^=a^=b;return true;}
int Add(int &a,int b){return(a+=b)>=MOD?a-=MOD:a;}
int vAdd(int a,int b){return(a+=b)>=MOD?a-=MOD:a;}
int Sub(int &a,int b){return(a-=b)<0?a+=MOD:a;}
int vSub(int a,int b){return(a-=b)<0?a+=MOD:a;}
int Mul(int a,int b){return 1ll*a*b%MOD;}
int qpow(int a,int b){
	int ret=1;
	while(b){if(b&1)ret=Mul(ret,a);a=Mul(a,a);b>>=1;}
	return ret;
}
int read(){
	char ch=getchar();int nn=0,ssss=1;
	while(ch<'0'||ch>'9'){if(ch=='-')ssss*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){nn=nn*10+(ch-'0');ch=getchar();}
	return nn*ssss;
}
bool add(int u,int v,int w){e[++tot].v=v;e[tot].w=w;e[tot].nxt=h[u];h[u]=tot;return true;}
bool otm(int x,int y){return x<1||x>a||y<1||y>b;}
int pos(int x,int y,int t,int flr){return (t*a*b+b*(x-1)+y)*2-flr;}
bool bfs(){
	for(int i=0;i<=t;i++)fir[i]=d[i]=0;
	d[q[qh=qt=1]=s]=1;fir[s]=h[s];
	while(qh<=qt){
		int np=q[qh++];
		for(int i=h[np];i;i=e[i].nxt){
			if(e[i].w==0||d[e[i].v])continue;
			d[e[i].v]=d[np]+1;
			fir[e[i].v]=h[e[i].v];
			q[++qt]=e[i].v;
			if(e[i].v==t){
				while(0);
				return true;
			}
		}
	}
	return false;
}
int dfs(int np,int flw){
	if(np==t)return flw;int rst=flw;
	for(int i=fir[np];i&&rst;i=e[i].nxt){
		fir[np]=i;
		if(e[i].w==0||d[e[i].v]!=d[np]+1)continue;
		int k=dfs(e[i].v,Min(rst,e[i].w));
		if(!k)d[e[i].v]=0;
		e[i].w-=k;e[i^1].w+=k;rst-=k;
	}
	return flw-rst;
}
int dinic(){
	int delta=0,ans=0;
	while(bfs())while(delta=dfs(s,INF))ans+=delta;
	return ans;
}
bool solve(int tme){
	s=0;t=(tme+1)*a*b*2+1;tot=1;
	for(int i=s;i<=t;i++)h[i]=0;
	for(int i=0;i<=tme;i++)
		for(int x=1;x<=a;x++)
			for(int y=1;y<=b;y++){
				add(pos(x,y,i,1),pos(x,y,i,0),1);
				add(pos(x,y,i,0),pos(x,y,i,1),0);
				if(i==tme)continue;
				add(pos(x,y,i,0),pos(x,y,i+1,1),1);
				add(pos(x,y,i+1,1),pos(x,y,i,0),0);
				for(int j=0;j<4;j++){
					if(otm(x+xx[j],y+yy[j]))continue;
					add(pos(x,y,i,0),pos(x+xx[j],y+yy[j],i+1,1),1);
					add(pos(x+xx[j],y+yy[j],i+1,1),pos(x,y,i,0),0);
				}
			}
	for(int i=1;i<=n;i++){
		add(0,pos(px[i],py[i],0,1),1);
		add(pos(px[i],py[i],0,1),0,0);
		add(pos(qx[i],qy[i],tme,0),t,1);
		add(t,pos(qx[i],qy[i],tme,0),0);
	}
	return dinic()==n;
}
bool getans(int x,int y,int t,int lim){
	if(t==lim){ax=x;ay=y;return true;}int np=pos(x,y,t,0);
	for(int i=h[np];i;i=e[i].nxt){
		if(e[i].w)continue;
		if(e[i].v==pos(x,y,t+1,1)){ansl[t]='S';return getans(x,y,t+1,lim);}
		if(e[i].v==pos(x,y-1,t+1,1)){ansl[t]='L';return getans(x,y-1,t+1,lim);}
		if(e[i].v==pos(x,y+1,t+1,1)){ansl[t]='R';return getans(x,y+1,t+1,lim);}
		if(e[i].v==pos(x-1,y,t+1,1)){ansl[t]='U';return getans(x-1,y,t+1,lim);}
		if(e[i].v==pos(x+1,y,t+1,1)){ansl[t]='D';return getans(x+1,y,t+1,lim);}
	}
	return false;
}
bool print(int x,int ans){
	getans(px[x],py[x],0,ans);
	printf("%d %d %d %d ",px[x],py[x],ax,ay);
	for(int i=0;i<ans;i++)putchar(ansl[i]);
	putchar('\n');
	return true;
}
int main(){
	n=read();a=read();b=read();
	for(int i=1;i<=n;i++){px[i]=read();py[i]=read();}
	for(int i=1;i<=n;i++){qx[i]=read();qy[i]=read();}
	int mx=a+b+n,np=0;
	for(int i=lg(mx);i+1;i--){
		if(np+(1<<i)>mx)continue;
		if(!solve(np+(1<<i)))np+=(1<<i);
	}
	solve(++np);printf("%d\n",np);
	for(int i=1;i<=n;i++)print(i,np);
}