1.23 Shortest path of the king

国王的最短路径

描述：

The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square t. As the king is not in habit of wasting his time, he wants to get from his current position s to square t in the least number of moves. Help him to do this.

国王单独在棋盘上。即使他是单独在棋盘上，他依然不能掉以轻心，因为他有重要的国际业务。例如，他必须他必须代表官方去一个广场。因为国王习惯不浪费时间，他想要从他现在的位置通过最少的移动到广场t。请你帮助他。

In one move the king can get to the square that has a common side or a common vertex with the square the king is currently in (generally there are 8 different squares he can move to).

通常，国王移动一步棋可以到达与国王当前所在的方格有公共边或者公共顶点的方格，通常，他可以移动8个方格。

输入：

The first line contains the chessboard coordinates of square s, the second line — of square t.

Chessboard coordinates consist of two characters, the first one is a lowercase Latin letter (from a to h), the second one is a digit from 1 to 8.

第一行包含广场s的坐标，第二行包含广场t的坐标。

棋盘包含2个字符，第一个是小写拉丁字母（从a到h），第二个是数字1到8。

输出：

In the first line print n — minimum number of the king's moves. Then in n lines print the moves themselves. Each move is described with one of the 8: L, R, U, D, LU, LD, RU or RD.

L, R, U, D stand respectively for moves left, right, up and down (according to the picture), and 2-letter combinations stand for diagonal moves. If the answer is not unique, print any of them.

在第一行打印出n——国王移动的最少步数。接下来n行输出移动的情况。每一步移动用8种方式表达：L，R，U，D，LU，LD，RU，RD。

L，R，U，D分别表示左，右，上，下（通过图片），另外两个字母组成的代表对角线移动。如果答案不唯一，任意输出一个。

样例输入：

a8
h1

样例输出：

7
RD
RD
RD
RD
RD
RD
RD