def Vivod(vec, n, m):
  for i in range(n):
    for j in range(m):
      print(vec[i][j], end = ' ')
    print()


def fibbi(n, m, vec2):

  ans = ''
  vec = [[0] * m for i in range(n)]
  vec[0][0] = vec2[0][0]

  for i in range(1, m):
    vec[0][i] = vec[0][i - 1] + vec2[0][i]

  for i in range(1, n):
    vec[i][0] = vec[i - 1][0] + vec2[i][0]

  for i in range(1, n):
    for j in range(1, m):
      vec[i][j] = max(vec[i - 1][j], vec[i][j - 1]) + vec2[i][j]
  i = n - 1
  j = m - 1
  #Vivod(vec, n, m)
  while i + j != 0:
   # print(i, j)
    if j == 0:
      ans += 'D ' * i
      break
    if i == 0:
      ans += 'R ' * j
      break
    if vec[i - 1][j] > vec[i][j - 1]:
      ans += 'D '
      i -= 1
      j = j
    else:
      ans += 'R '
      i = i
      j -= 1
  ans = ans[0:len(ans) - 1]
  print(vec[n - 1][m - 1])
  print(ans[::-1].replace('  ', '')+ ' ')


n, m = map(int, input().split())
vec2 =[[int(j) for j in input().split()] for i in range(n)]
fibbi(n, m, vec2)

"""
5 5
9 9 9 9 9
3 0 0 0 0
9 9 9 9 9
6 6 6 6 8
9 9 9 9 9
"""