#!/bin/python3 import sys def printShortestPath(n, i_start, j_start, i_end, j_end): if(abs(i_start-i_end)%2==1): print("Impossible") elif(i_start-i_end==0 and (j_start-j_end)%2!=0): print("Impossible") elif(i_start-i_end==0 and (j_start-j_end)%2==0) : if(j_start>j_end): print(int(j_start-j_end)) for i in range(int(j_start-j_end)): print('L',end=' ') elif(j_starti_end): v=i_start-i_end #for the left upper part if(j_start>j_end): lim_x=v/2 if(j_start-j_end)>lim_x: if((j_start-j_end-lim_x)%2==1): print("Impossible") return 0 else: UL=int(v/2) L=int((j_start-j_end-lim_x)/2) #print(1) print(UL+L) for i in range(UL): print('UL',end=' ') for j in range(L): print('L',end=' ') elif(j_start-j_end)lim_x: if((j_end-j_start-lim_x)%2==1): print("Impossible") return 0 else: UR=int(v/2) R=int((j_end-j_start-lim_x)/2) #print(5) print(UR+R) for i in range(UR): print('UR',end=' ') for j in range(R): print('R',end=' ') elif(j_end-j_start)j_end): lim_x=v/2 if(j_start-j_end)>lim_x: if((j_start-j_end-lim_x)%2==1): print("Impossible") return 0 else: UL=int(vertical/2) L=int((j_start-j_end-lim_x)/2) print(UL+L) for i in range(UL): print('LL',end=' ') for j in range(L): print('L',end=' ') elif(j_start-j_end)lim_x: if((j_end-j_start-lim_x)%2==1): print("Impossible") return 0 else: UR=int(v/2) R=int((j_end-j_start-lim_x)/2) print(UR+R) for i in range(R): print('R',end=' ') for j in range(UR): print('LR',end=' ') elif(j_end-j_start)