coding_assgn_week_5.py

def setup():
    global v
    v = [[0 for i in range(100)] for j in range(100)]
    global ans
    ans = ""
def path(arr, x, y, pth, n):
    if x == n-1 and y == n-1:
        global ans
        ans = ans + pth
        ans = ans + ' '
        return
    global v
    if arr[x][y] == 0 or v[x][y] == 1:
        return
    v[x][y]=1
    if x > 0:
        path(arr, x-1, y, pth+'U', n)
    if y > 0:
        path(arr, x, y-1, pth+'L', n)
    if x < n-1:
        path(arr, x+1, y, pth+'D', n)
    if y < n-1:
        path(arr, x, y+1, pth+'R', n)
    v[x][y]=0

def findPath(arr, n):
    global ans
    ans = ""

    if arr[0][0] == 0 or arr[n-1][n-1] == 0:
        return ans;

    setup()
    path(arr,0,0,"",n)
    ans = ans.split()
    res = ""
    for i in sorted(ans):
        res+=(i+' ')
    return res

if __name__=='__main__':
    t = int(input())
    for i in range(t):
        n = list(map(int, input().strip().split()))
        arr = list(map(int, input().strip().split()))
        matrix = [[0 for i in range(n[0])]for j in range(n[0])]
        k = 0
        for i in range(n[0]):
            for j in range(n[0]):
                while k < len(arr):
                    matrix[i][j] = arr[k]
                    k = k + 1

        result = findPath(matrix, n[0])
        if result == "":
            print(-1)
        else:
            print(result)