#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];
void Dfs(int x){
	if(!x)return;
	int ct=0;
	for(int i=1;i<=n;++i)val[i].fi=up[i],val[i].se=i,ct+=(up[i]>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),--up[val[i].se];
	Dfs(x-1);
	while(lf[x])op[++tt]=3,ps[tt]=x,--lf[x];
	while(rg[x])op[++tt]=4,ps[tt]=x,--rg[x];
	for(int v:vec)op[++tt]=1,ps[tt]=v;
}
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);
	print();
	return 0;
}