#include <bits/stdc++.h>

using namespace std;

const int N = 305, M = N * N;

int n;
int u[N], d[N], l[N], r[N];
int p[N];
string ans[M];
int tot;

int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &u[i]);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &d[i]);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &l[i]);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &r[i]);
    
    for(int i = 1; i <= n; i ++ )
        if(u[i] + d[i] > n || l[i] + r[i] > n)
            return puts("NO"), 0;
    
    for(int i = 1; i <= n; i ++ )
    {
        int cnt = n - l[i] - r[i];
        for(int j = 1; j <= n; j ++ ) p[j] = j;
        sort(p + 1, p + n + 1, [](const int i, const int j) {return u[i] > u[j];});
        int t0 = tot;
        for(int t = 1; t <= n && cnt; t ++ )
        {
            int j = p[t];
            if(u[j]) u[j] -- , cnt -- , ans[ ++ tot] = "U" + to_string(j);
        }
        for(int j = 1; j <= l[i]; j ++ ) ans[ ++ tot] = "L" + to_string(i);
        for(int j = 1; j <= r[i]; j ++ ) ans[ ++ tot] = "R" + to_string(i);
        // printf("#%d %d\n", i, tot);
        assert(tot - t0 == n);
    }

    for(int i = 1; i <= tot; i ++ ) printf("%s\n", ans[i].c_str());
    return 0;
}