#include<bits/stdc++.h>
using namespace std;
int n;
#define N 303
int up[N],dwn[N],lf[N],rg[N],op[N*N],ps[N*N],tt;
void print(){
	for(int i=1;i<=n*n;++i){
		if(op[i]==1)cout<<"U"<<ps[i]<<endl;
		else if(op[i]==2)cout<<"D"<<ps[i]<<endl;
		else if(op[i]==3)cout<<"L"<<ps[i]<<endl;
		else cout<<"R"<<ps[i]<<endl;
	}
}
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
pii val[N];
int vis[N],col[N][N];
vector<int>rd[N*N];
int dg[N*N];
int getid(int x,int y){
	return (x-1)*n+y;
}
void Add(int u,int v){
	rd[u].pb(v),++dg[v];
}
void Dfs(int x){
	if(!x)return;
	int ct=0;
	for(int i=1;i<=n;++i)val[i].fi=up[i]+dwn[i],val[i].se=i,ct+=(val[i].fi>0);
	sort(val+1,val+n+1),reverse(val+1,val+n+1);
	if(lf[x]+rg[x]+ct<n){
		cout<<"NO\n";
		exit(0);
	}
	ct=n-lf[x]-rg[x];vector<int>vec;
	for(int i=1;i<=ct;++i){
		vec.pb(val[i].se);
		if(dwn[val[i].se])--dwn[val[i].se],col[x][val[i].se]=2;
		else --up[val[i].se],col[x][val[i].se]=1;
	}
	Dfs(x-1);
	for(int i=1;i<=n;++i)vis[i]=0;
	for(int v:vec)vis[v]=1;
	int y=1,z1,z2;
	while(lf[x]){
		if(vis[y]){++y;continue;}
		col[x][y]=3,--lf[x],++y;
	}
	z1=y;
	y=n;
	while(rg[x]){
		if(vis[y]){--y;continue;}
		col[x][y]=4,--rg[x],--y;
	}
	z2=y;
}
int vis1[N*N],ins[N*N],fa[N*N],Fl;
int p[N*N],vp[N*N],tot;
void Rbd(int u){
	int j=(u-1)%n+1;
	int i=(u-j)/n+1;
	for(int v:rd[u])--dg[v];
	rd[u].clear();
	if(col[i][j]==1){
		for(int k=1;k<i;++k)
			Add(getid(i,j),getid(k,j));
	}else if(col[i][j]==2){
		for(int k=i+1;k<=n;++k)
			Add(getid(i,j),getid(k,j));
	}else if(col[i][j]==3){
		for(int k=1;k<j;++k)
			Add(getid(i,j),getid(i,k));
	}else{
		for(int k=j+1;k<=n;++k)
			Add(getid(i,j),getid(i,k));
	}
}
void Dfs1(int u,int cc){
	if(Fl)return;
	vis1[u]=ins[u]=cc;
	for(int v:rd[u]){
		if(Fl)return;
		if(!vis1[v]){
			fa[v]=u;
			Dfs1(v,cc);
			continue;
		}
		if(ins[v]!=cc)continue;
		tot=0,Fl=1;
		for(int x=u;x!=v;x=fa[x])p[++tot]=x;
		p[++tot]=p[0]=v;
		for(int i=1;i<=tot;++i){
			int Py=(p[i%tot+1]-1)%n+1;
			int Px=(p[i%tot+1]-Py)/n+1;
			vp[i]=col[Px][Py];
		}
		for(int i=1;i<=tot;++i){
			int Py=(p[i]-1)%n+1;
			int Px=(p[i]-Py)/n+1;
			col[Px][Py]=vp[i];
			Rbd(p[i]);
		}
		return;
	}ins[u]=0;
}
void Init(){
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			if(col[i][j]==1){
				for(int k=1;k<i;++k)
					Add(getid(i,j),getid(k,j));
			}else if(col[i][j]==2){
				for(int k=i+1;k<=n;++k)
					Add(getid(i,j),getid(k,j));
			}else if(col[i][j]==3){
				for(int k=1;k<j;++k)
					Add(getid(i,j),getid(i,k));
			}else{
				for(int k=j+1;k<=n;++k)
					Add(getid(i,j),getid(i,k));
			}
		}
	}
	int cc=0;
	for(int i=1;i<=n*n;++i){
		Fl=0;
		do{
			Fl=0,Dfs1(i,++cc);
		}while(Fl);
	}
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			Rbd(getid(i,j));
}
queue<int>q;
void Topo(){
	for(int i=1;i<=n*n;++i)
		if(!dg[i])q.push(i);
	while(!q.empty()){
		int u=q.front();
		q.pop();
		int py=(u-1)%n+1;
		int px=(u-py)/n+1;
		op[++tt]=col[px][py];
		if(col[px][py]<=2)ps[tt]=py;
		else ps[tt]=px;
		for(int v:rd[u]){
			--dg[v];
			if(!dg[v])q.push(v);
		}
	}
	reverse(op+1,op+tt+1);
	reverse(ps+1,ps+tt+1);
}
int main(){
	ios::sync_with_stdio(0);
	cin>>n;
	for(int i=1;i<=n;++i)cin>>up[i];
	for(int i=1;i<=n;++i)cin>>dwn[i];
	for(int i=1;i<=n;++i)cin>>lf[i];
	for(int i=1;i<=n;++i){
		cin>>rg[i];
		if(up[i]+dwn[i]>n){
			cout<<"NO\n";
			return 0;
		}
		if(lf[i]+rg[i]>n){
			cout<<"NO\n";
			return 0;
		}
	}
	Dfs(n);
	Init();
	Topo();
	print();
	return 0;
}