#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
int L[505],R[505],U[505],D[505],a[505],A[505][505],ord[505],ans[505][505];
//[0] 上,[1] 下,[2] 左,[3] 右

int cur[505][505];
void Set(int x,int y){
	if(ans[x][y] <= 1){
		cur[x][y] = x;
	}else{
		cur[x][y] = y;
	}
}

vector <pii> sta,tt;
int vis[505][505],cir[505][505];
void dfs(int x,int y){
//	printf("(%d,%d)\n",x,y);
	if(vis[x][y]){
//		printf("succful find circle:\n");
//		for(pii I:sta) printf("%d %d\n",I.first,I.second);
		pii nxt = mkp(-1,-1);
		while(1){
			pii prv = sta.back();
			sta.pop_back();
			if(nxt.first != -1){
				swap(ans[prv.first][prv.second],ans[nxt.first][nxt.second]);
				Set(nxt.first,nxt.second);
				cir[nxt.first][nxt.second] = 1;
			}
			nxt = prv;
			tt.eb(nxt);
			if(prv == mkp(x,y)) break;
		}
		while(!tt.empty()){
			sta.eb(tt.back());
			tt.pop_back();
		}
		Set(nxt.first,nxt.second);
		return;
	}

	vis[x][y] = 1;
	sta.eb(x,y);
	while(1){
		if(cir[x][y]){
			cir[x][y] = 0;
			Set(x,y);
			break;
		}
		if(!ans[x][y]){
//			assert(cur[x][y] >= 1);
			cur[x][y]--;
			if(cur[x][y] <= 0) break;
			dfs(cur[x][y],y);
		}else if(ans[x][y] == 1){
//			assert(cur[x][y] <= n);
			cur[x][y]++;
			if(cur[x][y] > n) break;
			dfs(cur[x][y],y);
		}else if(ans[x][y] == 2){
//			assert(cur[x][y] >= 1);
			cur[x][y]--;
			if(cur[x][y] <= 0) break;
			dfs(x,cur[x][y]);
		}else{
//			assert(cur[x][y] <= n);
			cur[x][y]++;
			if(cur[x][y] > n) break;
			dfs(x,cur[x][y]);
		}
	}
	
	sta.pop_back();
	vis[x][y] = 0;
}

void dbg(){
	printf("curans:\n");
	rep(i,1,n){
		rep(j,1,n) printf("%d",ans[i][j]);
		printf("\n");
		rep(j,1,n) assert(!vis[i][j]);
	}	
	rep(i,1,n){
		int temp = L[i] + R[i];
		rep(j,1,n) if(ans[i][j] >= 2) temp--;
		assert(!temp);
	}
	rep(i,1,n){
		int temp = U[i] + D[i];
		rep(j,1,n) if(ans[j][i] < 2) temp--;
		assert(!temp);
	}	
}

void slv(){
	rep(i,1,n){
		rep(j,1,n) Set(i,j);
	}

	rep(i,1,n){
		rep(j,1,n){
			while(1){
				if(ans[i][j] % 2 == 0){
					if(cur[i][j] < 0) break;
					dfs(i,j);
				}else{
					if(cur[i][j] > n) break;
					dfs(i,j);
				}
				assert(sta.empty());
			}
		}
	}
}

bool cmp(int x,int y){
	return a[x] > a[y];
}
int fail[505][505],inq[505][505];
queue <pii> Q;
void psh(int x,int y){
	if(fail[x][y] || inq[x][y]) return;
	inq[x][y] = 1;
	Q.push(mkp(x,y));
}

int main(){
#ifdef cxy
	freopen("test.in","r",stdin);
	freopen("test.out","w",stdout);
#endif
	scanf("%d",&n);
	rep(i,1,n) scanf("%d",&U[i]);
	rep(i,1,n) scanf("%d",&D[i]);
	rep(i,1,n) scanf("%d",&L[i]);
	rep(i,1,n) scanf("%d",&R[i]);

	rep(i,1,n) a[i] = U[i] + D[i];
	rep(i,1,n){
		rep(j,1,n) ord[j] = j;
		sort(ord + 1,ord + n + 1,cmp);
		if(U[i] + D[i] > n){
			printf("NO\n");
			return 0;
		}
		rep(j,1,n - L[i] - R[i]){
			if(!a[ord[j]]){
				printf("NO\n");
				return 0;
			}
			a[ord[j]]--;
			A[i][ord[j]] = 1;
		}
	}
	rep(i,1,n){
		int pos = 1;
		rep(k,1,L[i]){
			while(A[i][pos]) pos++;
			ans[i][pos] = 2;
			pos++;
		}
		pos = n;
		rep(k,1,R[i]){
			while(A[i][pos]) pos--;
			ans[i][pos] = 3;
			pos--;
		}
	}
	rep(i,1,n){
		int pos = 1;
		rep(k,1,U[i]){
			while(!A[pos][i]) pos++;
			ans[pos][i] = 0;
			pos++;
		}
		pos = n;
		rep(k,1,D[i]){
			while(!A[pos][i]) pos--;
			ans[pos][i] = 1;
			pos--;
		}
	}

	slv();
	rep(i,1,n){
		rep(j,1,n){
			if(!ans[i][j]){
				fail[i][j] = i - 1;
			}else if(ans[i][j] == 1){
				fail[i][j] = n - i;
			}else if(ans[i][j] == 2){
				fail[i][j] = j - 1;
			}else{
				fail[i][j] = n - j;
			}
			psh(i,j);
		}
	}

	while(!Q.empty()){
		pii temp = Q.front();
		Q.pop();
		int x = temp.first,y = temp.second;
		if(!ans[x][y]) printf("U%d\n",y);
		else if(ans[x][y] == 1) printf("D%d\n",y);
		else if(ans[x][y] == 2) printf("L%d\n",x);
		else printf("R%d\n",x);
		rep(p,x + 1,n){
			if(!ans[p][y]){
				fail[p][y]--;
				psh(p,y);
			}
		}
		rep(p,1,x - 1){
			if(ans[p][y] == 1){
				fail[p][y]--;
				psh(p,y);
			}
		}
		rep(q,y + 1,n){
			if(ans[x][q] == 2){
				fail[x][q]--;
				psh(x,q);
			}
		}
		rep(q,1,y - 1){
			if(ans[x][q] == 3){
				fail[x][q]--;
				psh(x,q);
			}
		}
	}
	rep(i,1,n){
		rep(j,1,n) assert(!fail[i][j]);
	}
	return 0; 
}