#define _CRT_SECURE_NO_WARNINGS
#include<set>
#include<cmath>
#include<queue>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long ll;

const int N=200010;
const int M=200010;
const int inf=1000000000;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,-1,1};
int n,m,q,st,ed,tot=1,head[N],d[N],cur[N];
vector<pair<int,int> >stx,edx;
vector<int>c[110];
struct Edge{
	int ver,suiv,edge;
	char dir;
}e[M<<1];

inline void _lnk(int x,int y,int z,char ch)
{
	e[++tot].ver=y;
	e[tot].edge=z;
	e[tot].suiv=head[x];
	head[x]=tot;
	e[tot].dir=ch;
}

inline void lnk(int x,int y,int z,char ch)
{
	_lnk(x,y,z,ch),_lnk(y,x,0,ch);
}

inline int dfs(int x,int flow)
{
	if(x==ed)return flow;
	int minflow,resflow=0;
	for(int &i=cur[x];i;i=e[i].suiv)
	//for(int i=head[x];i;i=e[i].suiv)
	{
		int y=e[i].ver;
		if(d[y]!=d[x]+1||!e[i].edge)continue;
		minflow=dfs(y,min(flow,e[i].edge));
		flow-=minflow;
		e[i].edge-=minflow;
		resflow+=minflow;
		e[i^1].edge+=minflow;
		if(!flow)break;
	}
	if(!resflow)d[x]=-1;
	return resflow;
}


inline bool bfs()
{
	memset(d,-1,sizeof(d));
	queue<int>q;
	q.push(st);
	d[st]=0;
	while(q.size())
	{
		int x=q.front();q.pop();
		for(int i=head[x];i;i=e[i].suiv)
		{
			int y=e[i].ver;
			if(~d[y]||!e[i].edge)continue;
			d[y]=d[x]+1;
			q.push(y);
		}
	}
	return ~d[ed];
}


inline ll dinic()
{
	ll res=0;
	while(bfs())
	{
		memcpy(cur,head,sizeof(head));
		res+=1ll*dfs(st,inf);
	}
	return res;
}

inline int _(int dep,int op,int x,int y)
{
	return ((dep-1)*2+op)*n*m+(x-1)*m+y;
}

inline void dfs1(int x,int id)
{
	//cout<<"dfs1 "<<x<<" "<<id<<endl;
	if(x==ed)return;
	for(int i=head[x];i;i=e[i].suiv)
	{
		int y=e[i].ver,z=e[i].edge;
		if((i&1)||z)continue;
		if(e[i].dir!=0)c[id].push_back(e[i].dir)
			//,cout<<"id "<<id<<" "<<char(e[i].dir)<<endl
			;
		dfs1(y,id);
	}
}

inline bool valid(int mid)
{
	tot=1;
	memset(head,0,sizeof(head));
	st=0,ed=N-1;
	for(auto pos:stx)
		lnk(st,_(1,0,pos.first,pos.second),1,0);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			lnk(_(1,0,i,j),_(1,1,i,j),1,0);
	for(int i=1;i<=q;i++)
		lnk(N-1-i,ed,1,0);
	for(int i=1;i<=q;i++)
		lnk(_(1,1,edx[i-1].first,edx[i-1].second),N-1-i,1,0);
	for(int i=1;i<=mid;i++)
	{
		for(int j=1;j<=n;j++)
			for(int k=1;k<=m;k++)
			{
				for(int l=0;l<4;l++)
				{
					int posx=j+dx[l],posy=k+dy[l];
					if(posx<1||posx>n||posy<1||posy>m)continue;
					char ch;
					if(dx[l]==0&&dy[l]==1)ch='R';
					else if(dx[l]==0&&dy[l]==-1)ch='L';
					else if(dx[l]==-1&&dy[l]==0)ch='U';
					else ch='D';
					//cout<<"lnk "<<ch<<endl;
					lnk(_(i,1,j,k),_(i+1,0,posx,posy),1,ch);
				}
				lnk(_(i,1,j,k),_(i+1,0,j,k),1,'S');
				lnk(_(i+1,0,j,k),_(i+1,1,j,k),1,0);
			}
		for(int j=1;j<=q;j++)
			lnk(_(i+1,1,edx[j-1].first,edx[j-1].second),N-1-j,1,0);
	}
	return dinic()>=q;
}


signed main()
{
	scanf("%d%d%d",&q,&n,&m);
	//swap(n,m);
	for(int i=1,x,y;i<=q;i++)
		scanf("%d%d",&x,&y)
		//,swap(x,y)
		,stx.push_back(make_pair(x,y));
	for(int i=1,x,y;i<=q;i++)
		scanf("%d%d",&x,&y)
		//,swap(x,y)
		,edx.push_back(make_pair(x,y));
	
	//dinic();
	//cout<<maxflow<<endl;
	//ans=3;
	//cout<<valid(25)<<endl;
	int l=1,r=n*m,ans=-1;
	while(l<=r)
	{
		int mid=l+r>>1;
		//cout<<"valid "<<mid<<endl;
		if(valid(mid))r=mid-1,ans=mid
			//,cout<<"ok"<<endl
			;
		else l=mid+1
			//,cout<<"no"<<endl
			;
	}
	valid(ans);
	printf("%d\n",ans);
	for(int i=1;i<=q;i++)
		dfs1(_(1,0,stx[i-1].first,stx[i-1].second),i);
	for(int i=1;i<=q;i++)
	{
		//for(int j=1,lim=c[i].size();j<=lim;j++)
		//	printf("%c",c[i][j-1]);
		//putchar('\n');


		printf("%d %d ",stx[i-1].first,stx[i-1].second);
		int posx=stx[i-1].first,posy=stx[i-1].second;
		for(int j=1;j<=ans;j++)
		{
			if(j>c[i].size())break;
			if(c[i][j-1]=='S')continue;
			if(c[i][j-1]=='R')posy+=1;
			if(c[i][j-1]=='L')posy-=1;
			if(c[i][j-1]=='U')posx-=1;
			if(c[i][j-1]=='D')posx+=1;
		}
		printf("%d %d ",posx,posy);
		for(int j=1,lim=c[i].size();j<=ans;j++)
			printf("%c",j<=lim?c[i][j-1]:'P');
		putchar('\n');
	}
	return 0;
}