#include<bits/stdc++.h>

#define mms(a,n) memset(a,0,sizeof((a)[0])*(n))
#define mmp(a,b,n) memcpy(a,b,sizeof((b)[0])*(n))
#define lowbit(x) ((x)&-(x))
#define pb push_back
#define fi first
#define se second
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define lowbit(x) ((x)&-(x))
#define fo(i,l,r) for(register int i=l,_lim_=r;i<=_lim_;i++)
#define fd(i,r,l) for(register int i=r;_lim_=l;i>=_lim_;i--)

using namespace std;
typedef long long ll;
typedef pair<int,int> pi;

namespace io{
	const int L=(1<<19)+1;
	char ibuf[L],*iS,*iT,obuf[L],*oS=obuf,*oT=obuf+L-1,c,st[55];int f,tp;
	inline char gc(){
		if(iS==iT){
			iT=(iS=ibuf)+fread(ibuf,1,L,stdin);
			return iS==iT?EOF:*iS++;
		}
		return*iS++;
	}
	inline void flush(){fwrite(obuf,1,oS-obuf,stdout);oS=obuf;}
	inline void putc(char x){*oS++=x;if(oS==oT)flush();}
	template<class I>
	inline void gi(I&x){
		for(f=1,c=gc();c<'0'||c>'9';c=gc())if(c=='-')f=-1;
		for(x=0;c<='9'&&c>='0';c=gc())x=x*10+(c&15);x*=f;
	}
	template<class I>
	inline void print(I x){
		if(!x)putc('0');if(x<0)putc('-'),x=-x;
		while(x)st[++tp]=x%10+'0',x/=10;
		while(tp)putc(st[tp--]);
	}
	inline void gs(char*s,int&l){
		for(c=gc();c!='_'&&(c<'a'||c>'z');c=gc());
		for(l=0;c=='_'||c<='z'&&c>='a';c=gc())s[l++]=c;
	}
};
using io::putc;
using io::gi;
using io::gs;
using io::print;

const int N=205;

const string dz[6]={"UL","UR","R","LR","LL","L"};
const int dx[6]={-2,-2,0,2,2,0};
const int dy[6]={-1,1,2,1,-1,-2};

vector<string> e[N][N];
bool vi[N][N];
queue<pi> Q;
int n,x,y;

void expand(vector<string> &p,string i,int x,int y){
	if(x<0||y<0||x>=n||y>=n||vi[x][y])return;
	e[x][y]=p;e[x][y].pb(i);vi[x][y]=true;Q.push({x,y});
}

int main(){
	gi(n),gi(x),gi(y);
	Q.push({x,y});vi[x][y]=true;
	while(Q.size()){
		x=Q.front().fi;y=Q.front().se;Q.pop();
		for(int i=0;i<6;i++)expand(e[x][y],dz[i],x+dx[i],y+dy[i]);
	}
	gi(x),gi(y);
	if(!vi[x][y])puts("Impossible"),exit(0);
	cout<<e[x][y].size()<<endl;
	for(auto&i:e[x][y])cout<<i<<' ';
	return 0;
}