Вывести маршрут максимальной стоимости

N,M=map(int,input().split())
P=[list(map(int,input().split())) for i in range (N)]
A=[[0]*M for i in range(N)]
A[0][0]=P[0][0]
for j in range(1,M):
    A[0][j]=A[0][j-1]+P[0][j]
for j in range(1,N):
    A[j][0]=A[j-1][0]+P[j-1][0]
for i in range(1,N):
    for j in range(1,M):
        A[i][j]=max(A[i-1][j],A[i][j-1])+P[i][j]
print(A[-1][-1])
V=[]
i=-1 
j=-1
for k in range(M+N-1):
    if j==-M:
        while i!=-N:
            V.append('D')
            i-=1
        break                
    if i==-N:
        while j!=-M:
            V.append('R')
            j-=1
        break           
    if A[i-1][j]>A[i][j-1]:
        V.append("D")
        i-=1
    else:
        V.append('R')
        j-=1
print(" ".join(V[::-1]))

n,m->3 3
row1->1 2 3
row2->4 5 6
row3->7 8 9
25
R D D R

n,m = map(int, input('n, m->').split())
matr =[list(map(int, input(f'row_{i+1}->').split())) for i in range(n)]
res_m = [[0]*m for _ in range(n)]
for i in range(n):
    for j in range(m):
        if not i+j:
            res_m[i][j] = matr[i][j]
        elif not i:
            res_m[i][j] = matr[i][j] + res_m[i][j-1]
        elif not j:
            res_m[i][j] = matr[i][j] + res_m[i-1][j]
        else:
            res_m[i][j] = matr[i][j] + max(res_m[i-1][j], res_m[i][j-1])
 
path = ''
i,j = n-1, m-1
print(res_m[i][j])
while i or j:
    path = ('R' if i==0 else 'D' if j==0 else ['R','D'][res_m[i-1][j] >= res_m[i][j-1]]) + path
    if path[0] == 'R':
        j -= 1
    else:
        i -= 1
print(' '.join(path))