#include <bits/stdc++.h>

using namespace std;

const int N = 605;

int n;
int u[N], d[N], l[N], r[N];

template<const int N, const int M>
struct Dinic{
    int s, t;
    int la[N], cur[N], ne[M], en[M], w[M], idx = 1;
    int dis[N], q[N], hh, tt;
    
    inline void AddEdge(int a, int b, int c)
    {
        ne[ ++ idx] = la[a];
        la[a] = idx;
        en[idx] = b;
        w[idx] = c;
    }
    inline void Add(int a, int b, int c)
    {
        AddEdge(a, b, c);
        AddEdge(b, a, 0);
    }
    inline bool BFS()
    {
        memset(dis, -1, sizeof dis);
        dis[s] = 0;
        q[hh = tt = 0] = s;
        while(hh <= tt)
        {
            int u = q[hh ++ ];
            if(u == t) return 1;
            cur[u] = la[u];
            for(int i = la[u]; i; i = ne[i])
            {
                int v = en[i];
                if(w[i] && dis[v] == -1)
                {
                    dis[v] = dis[u] + 1;
                    q[ ++ tt] = v;
                }
            }
        }
        return 0;
    }
    inline int DFS(int u, int f)
    {
        if(u == t || !f) return f;
        int res = 0;
        for(int &i = cur[u]; i; i = ne[i])
        {
            int v = en[i];
            if(dis[v] == dis[u] + 1 && w[i])
            {
                int d = DFS(v, min(f, w[i]));
                if(!d) dis[v] = -1;
                f -= d, res += d;
                w[i] -= d, w[i ^ 1] += d;
            }
        }
        return res;
    }
    inline int MaxFlow()
    {
        int res = 0;
        while(BFS()) res += DFS(s, 1e9);
        return res;     
    }
};
Dinic<N * N + N * 2, 6 * N * N + 4 * N> G;

struct Point{
    int x, y;
    Point() {}
    Point(int _x, int _y) : x(_x), y(_y) {}
    inline void Go(char dir)
    {
        if(dir == 'U') x -- ;
        if(dir == 'D') x ++ ;
        if(dir == 'L') y -- ;
        if(dir == 'R') y ++ ;
    }
    inline bool Inside()
    {
        return 1 <= x && x <= n && 1 <= y && y <= n;
    }
};
template<typename T>
struct Array2{
    T a[N][N] = {};
    inline T* operator [](const int &i) {return a[i];}
    inline T& operator [](const Point &i) {return a[i.x][i.y];}
};

Array2<char> a;
Array2<int> pos;
Array2<Point> cur;
Point sta[N * N], sta0[N * N];
int tt, tt0;

inline bool DFS(Point x)
{
    sta[ ++ tt] = x;
    sta0[ ++ tt0] = x;
    pos[x] = tt;
    for(Point &y = cur[x]; y.Inside(); y.Go(a[x]))
    {
        if(a[y] == a[x]) continue;
        if(!pos[y])
        {
            if(DFS(y)) return 1;
        }
        else if(pos[y] > 0)
        {
            Point yy = y, y = yy;
            char d0 = a[x];
            for(int i = tt; i > pos[y]; i -- )
            {
                a[sta[i]] = a[sta[i - 1]];
                cur[sta[i]] = sta[i];
            }
            a[y] = d0, cur[y] = y;
            return 1;
        }
    }
    tt -- ;
    pos[x] = -1;
    return 0;
}

int vis[N][N], mark[N][N];
pair<int, int> q[N * N];
string ans[N * N];
inline bool Topo()
{
    int hh = 1, tt = 0;
    memset(vis, 0, sizeof vis);
    memset(mark, 0, sizeof mark);
    for(int i = 1; i <= n; i ++ )
        for(int j = 1; j <= n; j ++ )
        {
            if(!vis[i][j] && a[i][j] == 'U' && (i == 1 || vis[i - 1][j])) q[ ++ tt] = {i, j}, mark[i][j] = 1;
            if(!vis[i][j] && a[i][j] == 'D' && (i == n || vis[i + 1][j])) q[ ++ tt] = {i, j}, mark[i][j] = 1;
            if(!vis[i][j] && a[i][j] == 'L' && (j == 1 || vis[i][j - 1])) q[ ++ tt] = {i, j}, mark[i][j] = 1;
            if(!vis[i][j] && a[i][j] == 'R' && (j == n || vis[i][j + 1])) q[ ++ tt] = {i, j}, mark[i][j] = 1;
        }
    while(hh <= tt)
    {
        int i = q[hh].first, j = q[hh].second;
        vis[i][j] = 1;
        if(a[i][j] == 'U' || a[i][j] == 'D') ans[hh] = a[i][j] + to_string(j);
        else ans[hh] = a[i][j] + to_string(i);
        hh ++ ;
        // printf("!%d %d\n", i, j);
        for(int k = 1; k <= n; k ++ )
            if(!vis[k][j])
            {
                if(a[k][j] == 'U' && !mark[k][j]) q[ ++ tt] = {k, j}, mark[k][j] = 1;
                break;
            }
        for(int k = n; k >= 1; k -- )
            if(!vis[k][j])
            {
                if(a[k][j] == 'D' && !mark[k][j]) q[ ++ tt] = {k, j}, mark[k][j] = 1;
                break;
            }
        for(int k = 1; k <= n; k ++ )
            if(!vis[i][k])
            {
                if(a[i][k] == 'L' && !mark[i][k]) q[ ++ tt] = {i, k}, mark[i][k] = 1;
                break;
            }
        for(int k = n; k >= 1; k -- )
            if(!vis[i][k])
            {
                if(a[i][k] == 'R' && !mark[i][k]) q[ ++ tt] = {i, k}, mark[i][k] = 1;
                break;
            }
    }
    // for(int i = 1; i <= n; i ++ )
    // {
    //     for(int j = 1; j <= n; j ++ )
    //         printf("%d", vis[i][j]);
    //     puts("");
    // }
    // exit(0);
    return tt == n * n;
}

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]);
    
    G.s = n * n + n * 2 + 1, G.t = G.s + 1;
    for(int i = 1; i <= n; i ++ )
        for(int j = 1; j <= n; j ++ )
        {
            G.Add(G.s, (i - 1) * n + j, 1);
            G.Add((i - 1) * n + j, j + n * n, 1);
            G.Add((i - 1) * n + j, i + n * n + n, 1);
        }
    for(int i = 1; i <= n; i ++ )
    {
        G.Add(i + n * n, G.t, u[i] + d[i]);
        G.Add(i + n * n + n, G.t, l[i] + r[i]);
    }
    if(G.MaxFlow() != n * n) return puts("NO"), 0;
    for(int i = 1; i <= n; i ++ )
        for(int j = 1; j <= n; j ++ )
        {
            if(G.w[((i - 1) * n + j - 1) * 6 + 5]) a[i][j] = 'U';
            else a[i][j] = 'L';
        }
    
    for(int i = 1; i <= n; i ++ )
    {
        int cc = 0;
        for(int j = 1; j <= n && cc < u[i]; j ++ )
            if(a[j][i] == 'U' || a[j][i] == 'D')
            {
                a[j][i] = 'U';
                cc ++ ;
            }
        cc = 0;
        for(int j = n; j >= 1 && cc < d[i]; j -- )
            if(a[j][i] == 'U' || a[j][i] == 'D')
            {
                a[j][i] = 'D';
                cc ++ ;
            }
        cc = 0;
        for(int j = 1; j <= n && cc < l[i]; j ++ )
            if(a[i][j] == 'L' || a[i][j] == 'R')
            {
                a[i][j] = 'L';
                cc ++ ;
            }
        cc = 0;
        for(int j = n; j >= 1 && cc < r[i]; j -- )
            if(a[i][j] == 'L' || a[i][j] == 'R')
            {
                a[i][j] = 'R';
                cc ++ ;
            }
    }

    // for(int i = 1; i <= n; i ++ ) printf("%s\n", a[i] + 1);
    // puts("");
    for(int k = 1; k <= n; k ++ )
        for(int l = 1; l <= n; l ++ )
            cur[k][l] = Point(k, l);
    for(int i = 1; i <= n; i ++ )
        for(int j = 1; j <= n; j ++ )
        {
            while(DFS(Point(i, j)))
            {
                for(int i = 1; i <= tt0; i ++ ) pos[sta0[i]] = 0;
                tt = tt0 = 0;
            }
            for(int i = 1; i <= tt0; i ++ ) pos[sta0[i]] = 0;
            tt = tt0 = 0;
        }
    // for(int i = 1; i <= n; i ++ ) printf("%s\n", a[i] + 1);
    
    Topo();
    for(int i = 1; i <= n * n; i ++ ) printf("%s\n", ans[i].c_str());

    return 0;
}