import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) { int i,j,k,count=0; int kr=i_start; int kc=j_start; int pr=i_end; int pc=j_end; String s=""; A: for(i=0;i<100;i++) { if( ( Math.abs(pr-kr) )%2==0) { if(pr>kr ) { if(pc==kc) { if(( Math.abs(pr-kr) )%4==0) { int times= (pr-kr)/4 ; System.out.println(times*2); for(int vp=0;vpkc) { for(j=0;j<100;j++) { kc=kc+1; kr= kr+2; s=s+"LR "; if((kc> (n-1)) ||(kc<0) ||(kr>(n-1))||(kr<0) ) { System.out.println("Impossible"); break A; } if(kc==pc && kr==pr) { String V[]= s.split(" "); System.out.println(V.length); System.out.println(s); break A; } else if(kr==pr) { if (( pc-kc )%2==0) { int times= (pc-kc)/2; String adi=""; for(int vp=0;vppc || kr>pr ) { System.out.println("Impossible"); break A; } } } else if(pcpr ) { System.out.println("Impossible"); break A; } } } } else if(prkc) { for(j=0;j<100;j++) { kc=kc+1; kr= kr-2; s=s+"UR "; if(kc==pc && kr==pr) { String V[]= s.split(" "); System.out.println(V.length); System.out.println(s); break A; } else if(kr==pr) { if (( pc-kc )%2==0) { int times= (pc-kc)/2; for(int vp=0;vppc || krkc) { int times= (pc-kc)/2 ; System.out.println(times); for(int vp=0;vppc) { int times= (kc-pc)/2 ; System.out.println(times); for(int vp=0;vp