#include<bits/stdc++.h>
#define ll long long
#define rll register ll
#define ri register int
#define fo(i,x,y) for(ri i=(x);i<=(y);++i)
#define fu(i,x,y) for(ri i=(x);i<(y);++i)
#define fd(i,x,y) for(ri i=(x);i>=(y);--i)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N=205,M=2e5+5;
int n,A,B,S,T,tt,to[M],nt[M],hd[M],v[M],cnt;
int cur[M],dis[M],q[M],jl[M],ne[M];
int fx[4][2]={0,1,0,-1,1,0,-1,0};
struct nd{int x,y;}a[N],b[N];
inline void air(){}
inline nd jm(ri x){
	x%=A*B;if(!x)x=A*B;
	nd op;
	op.x=(x-1)/B+1;
	op.y=x-(op.x-1)*B;
	return op;
}
inline int id(ri x,ri y,ri z){return (x-1)*A*B+(y-1)*B+z;}
inline int operator==(nd x,nd y){
	return x.x==y.x&&x.y==y.y;
}
inline int cmp(nd x,nd y){
	if(x.x!=y.x)return x.x<y.x;
	return x.y<y.y;
}
inline void add(ri x,ri y,ri z){
	to[++tt]=y;nt[tt]=hd[x];hd[x]=tt;v[tt]=z;
//	if(tt==478)
//	air();
}
inline void link(ri x,ri y,ri z){add(x,y,z);add(y,x,0);}
inline int bfs(){
	ri h=0,t=1;q[1]=S;
	fo(i,1,T)dis[i]=1e9,cur[i]=hd[i];
	dis[S]=0;
	while(h<t){
		ri x=q[++h];
		for(ri i=hd[x];i;i=nt[i]){
			ri y=to[i];
			if(dis[y]==1e9&&v[i]){
				dis[y]=dis[x]+1;
				q[++t]=y;
			}
		}
	}
	return dis[T]!=1e9;
}
inline int dfs(ri x,ri fw){
	if(x==T||!fw)return fw;
	ri nd=0;
//	if(x==88)
//	air();
	for(ri i=cur[x];i&&fw;i=nt[i]){
		ri y=to[i];cur[x]=i;
		if(dis[y]==dis[x]+1&&v[i]){
			ri Fw=dfs(y,min(v[i],fw));
			if(!Fw)dis[y]=1e9;
			else{
				v[i]-=Fw;v[i^1]+=Fw;
				fw-=Fw;nd+=Fw;
				if(i%2==0)ne[x]=y;
//				if(x==99||y==99)
//				air();
			}
		}
	}
	return nd;
}
inline int check(ri lim){
	fo(i,1,T)hd[i]=0;
	fo(i,1,tt)to[i]=nt[i]=v[i]=0;
	S=2*lim*A*B+n+1;T=S+1;
	tt=1;
	fo(i,1,n){
		link(S,id(1,a[i].x,a[i].y),1);
		link(2*lim*A*B+i,T,1);
	}
	fo(t,1,lim){
		fo(i,1,n){
			link(id(t+lim,b[i].x,b[i].y),2*lim*A*B+i,1);
		}
		fo(i,1,A)fo(j,1,B){
//			if(tt==477)
//			air();
			link(id(t,i,j),id(t+lim,i,j),1);
			if(t<lim){
				fo(k,0,3){
					ri x=i+fx[k][0],y=j+fx[k][1];
					if(!x||!y||x>A||y>B)continue;
					link(id(t+lim,i,j),id(t+1,i,j),1);
					link(id(t+lim,i,j),id(t+1,x,y),1);
				}
			}
		}
	}
	ri s=0;
	while(bfs()){
		s+=dfs(S,1e9);
	}
	return s==n;
}
int main(){
//	freopen("B.in","r",stdin);
//	freopen("B.out","w",stdout);
	scanf("%d%d%d",&n,&A,&B);
	fo(i,1,n){
		scanf("%d%d",&a[i].x,&a[i].y);
	}
	fo(i,1,n){
		scanf("%d%d",&b[i].x,&b[i].y);
	}
	sort(a+1,a+1+n,cmp);
	sort(b+1,b+1+n,cmp);
	ri PD=0;
	fo(i,1,n){
		if(!(a[i]==b[i]))PD=1;
	}
	if(!PD){
		fo(i,1,n){
			printf("%d %d %d %d\n",a[i].x,a[i].y,b[i].x,b[i].y);
		}
		return 0;
	}
	S=2*n+1;T=S+1;
	ri l=1,r=(A+B)*2;
	while(l<=r){
		ri md=l+r>>1;
		if(check(md))r=md-1;
		else l=md+1;
	}
	printf("%d\n",r);
	check(r+1);
	fo(i,1,n){
		ri u=id(1,a[i].x,a[i].y);
		ri m=0,la=0;
		while(u!=T){
			u=ne[u];jl[++m]=u;
		}
		nd o=jm(jl[m-2]);
		printf("%d %d %d %d ",a[i].x,a[i].y,o.x,o.y);
		nd nw=a[i];ri cc=0;
		for(ri j=2;j<m-2;j+=2){
			nd ou=jm(jl[j]);
			if(ou.x-nw.x==1)putchar('D');
			else if(ou.x-nw.x==-1)putchar('U');
			else if(ou.y-nw.y==1)putchar('R');
			else if(ou.y-nw.y==-1)putchar('L');
			else putchar('S');
			++cc;nw=ou;
		}
		fo(j,1,r-cc)putchar('P');
		puts("");
	}
	cerr<<endl<<endl<<"time:"<<(double)clock()/CLOCKS_PER_SEC<<endl;
}