// Arup Guha
// 12/5/2015
// Solution to Fall 2015 UCF HS Online Contest Problem: Solid Snake

import java.util.*;

public class snake {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {

			// Read in the three numbers.
			int len = stdin.nextInt();
			int[] upLeft = new int[2];
			int[] lowRight = new int[2];
			upLeft[0] = stdin.nextInt();
			lowRight[1] = stdin.nextInt();
			lowRight[0] = stdin.nextInt();
			upLeft[1] = stdin.nextInt();

			// Just makes snaking through the box easier.
			int width = lowRight[0] - upLeft[0] + 1;
			int height = upLeft[1] - lowRight[1] + 1;

			// Position ourselves at the top left of the box with snake head IN that square.
			StringBuilder sb = new StringBuilder();
			for (int i=0; i<101; i++) sb.append("U");
			for (int i=0; i<400; i++) sb.append("L");
			for (int i=0; i<len+(101-upLeft[1]); i++) sb.append("D");
			for (int i=0; i<upLeft[0]+400; i++) sb.append("R");

			// Now iterate, snaking right and left, placing the snake in the box.
			for (int i=0; i<height; i++) {

				// Depending which iteration, we are going either right or left.
				if (i%2 == 0)
					for (int j=0; j<width-1; j++) sb.append("R");
				else
					for (int j=0; j<width-1; j++) sb.append("L");

				// Important not to do this the very last time through.
				if (i != height-1) sb.append("D");
			}

			// Output the result.
			System.out.println("Mission #"+loop+": "+sb);
		}
	}
}