#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
mt19937 rnd(time(0));
const int MAXN=5005;
int tid,T;
bool ri[MAXN][MAXN],dw[MAXN][MAXN];
bool vis[MAXN][MAXN];
map<array<int,6>,string> mp;
int max_len(int n,int m,int x1,int y1,int x2,int y2){
	if(x1==x2&&y1==y2) return 1;
	if(n>m) return max_len(m,n,y1,x1,y2,x2);
	if(x1>x2) return max_len(n,m,n+1-x1,y1,n+1-x2,y2);
	if(y1>y2) return max_len(n,m,x1,m+1-y1,x2,m+1-y2);
	if(n==1) return y2-y1+1;
	if(n==2&&x2-x1==1&&y2-y1<=1) return max(y1+y2,2*m+2-y1-y2);
	if(n*m&1) return n*m-((x1+y1)&1)-((x2+y2)&1);
	if(n==3&&((x1+x2+y1+y2)&1)&&((y2-y1>=2&&((x1+y1)&1))||(x1==2&&x2==2&&(y1&1)))) return n*m-2;
	return n*m-(~(x1+x2+y1+y2)&1); 
}
string replace(string s,char L,char R,char U,char D){
	for(int i=0;i<s.length();i++){
		if(s[i]=='L') s[i]=L;
		else if(s[i]=='R') s[i]=R;
		else if(s[i]=='U') s[i]=U;
		else if(s[i]=='D') s[i]=D;
	}
	return s;
}
string rev(string s){
	reverse(s.begin(),s.end());
	return replace(s,'R','L','D','U');
}
string solve(int n,int m,int x1,int y1,int x2,int y2){
	if(x1==x2&&y1==y2) return (string){};
	if(mp.count({n,m,x1,y1,x2,y2})) return mp[{n,m,x1,y1,x2,y2}];
	if(n>m) return replace(solve(m,n,y1,x1,y2,x2),'U','D','L','R');
	if(x1>x2) return replace(solve(n,m,n+1-x1,y1,n+1-x2,y2),'L','R','D','U');
	if(y1>y2) return replace(solve(n,m,x1,m+1-y1,x2,m+1-y2),'R','L','U','D');
	if(n==1) return string(y2-y1,'R');
	int C=max_len(n,m,x1,y1,x2,y2);
	for(int x=1;x<=n;x++) if(x1<=x&&x<x2) for(int y=1;y<=m;y++){
		if(C==max_len(x,m,x1,y1,x,y)+max_len(n-x,m,1,y,x2-x,y2)){
			return solve(x,m,x1,y1,x,y)+"D"+solve(n-x,m,1,y,x2-x,y2);
		}
	}
	for(int y=1;y<=m;y++) if(y1<=y&&y<y2) for(int x=1;x<=n;x++){
		if(C==max_len(n,y,x1,y1,x,y)+max_len(n,m-y,x,1,x2,y2-y)){
			return solve(n,y,x1,y1,x,y)+"R"+solve(n,m-y,x,1,x2,y2-y);
		}
	}
	if(n==3&&y1==y2){
		int x3=6-x1-x2;
		if(3+max_len(3,y1-1,x1,y1-1,x3,y1-1)+max_len(3,m-y1,x3,1,x2,1)==C){
			return "L"+solve(3,y1-1,x1,y1-1,x3,y1-1)+"RR"+
			solve(3,m-y1,x3,1,x2,1)+"L";
		}
		if(3+max_len(3,m-y1,x1,1,x3,1)+max_len(3,y1-1,x3,y1-1,x2,y1-1)==C){
			return "R"+solve(3,m-y1,x1,1,x3,1)+"LL"+
			solve(3,y1-1,x3,y1-1,x2,y1-1)+"R";
		}
	}else if(n==3&&y2-y1==1){
		assert(x1==1&&x2==3);
		if(6+max_len(3,m-y2,1,1,2,1)+max_len(3,y1-1,2,y1-1,3,y1-1)==C)
			return "RR"+solve(3,m-y2,1,1,2,1)+"LLL"+
			solve(3,y1-1,2,y1-1,3,y1-1)+"RR";
	}
	bool flag=(x1==x2);string s;
	if(flag) swap(n,m),swap(x1,y1),swap(x2,y2);
	for(int o:{0,1}){
	for(int i=x2+1;i<=n;i++){
		if(n+max_len(n,m-y1,1,1,i,1)+max_len(n,y1-1,n,y1-1,i-1,y1-1)==C){
			s=string(x1-1,'U')+"R"+solve(n,m-y1,1,1,i,1)+"L"+string(n-i,'D')+"L"+
			solve(n,y1-1,n,y1-1,i-1,y1-1)+"R"+string(i-1-x2,'U');
			if(o) s=replace(s,'R','L','U','D');
			if(!flag) return s;
			return replace(s,'U','D','L','R');
		}else if(n+max_len(n,m-y1,1,1,n,1)+max_len(n,y1-1,i,y1-1,i-1,y1-1)==C){
			s=string(x1-1,'U')+"R"+solve(n,m-y1,1,1,n,1)+"L"+string(n-i,'U')+"L"+
			solve(n,y1-1,i,y1-1,i-1,y1-1)+"R"+string(i-1-x2,'U');
			if(o) s=replace(s,'R','L','U','D');
			if(!flag) return s;
			return replace(s,'U','D','L','R');
		}
	}
	for(int i=1;i<x1;i++){
		if(n+max_len(n,m-y1,i+1,1,i,1)+max_len(n,y1-1,1,y1-1,n,y1-1)==C){
			s=string(x1-i-1,'U')+"R"+solve(n,m-y1,i+1,1,i,1)+"L"+string(i-1,'U')+"L"+
			solve(n,y1-1,1,y1-1,n,y1-1)+"R"+string(n-x2,'U');
			if(o) s=replace(s,'R','L','U','D');
			if(!flag) return s;
			return replace(s,'U','D','L','R');
		}else if(n+max_len(n,m-y1,i+1,1,1,1)+max_len(n,y1-1,i,y1-1,n,y1-1)==C){
			s=string(x1-i-1,'U')+"R"+solve(n,m-y1,i+1,1,1,1)+"L"+string(i-1,'D')+
			"L"+solve(n,y1-1,i,y1-1,n,y1-1)+"R"+string(n-x2,'U');
			if(o) s=replace(s,'R','L','U','D');
			if(!flag) return s;
			return replace(s,'U','D','L','R');
		}
	}
	y1=y2=m+1-y1;
	}
	assert(0);
}
int main(){
	ios::sync_with_stdio(false);
	// freopen("Otomachi_Una.in","r",stdin);
	// freopen("Otomachi_Una.out","w",stdout);
	cin>>tid>>T;
	if(tid<=4)tid=0;
	else tid=1;
	while(T--){
		int n,m,x1,y1,x2,y2;
		cin>>n>>m>>x1>>y1>>x2>>y2;
		if(tid) cout<<max_len(n,m,x1,y1,x2,y2)<<'\n';
		else{
			string s=solve(n,m,x1,y1,x2,y2);
			for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) vis[i][j]=ri[i][j]=dw[i][j]=0;
			int x=x1,y=y1;
			for(char c:s){
				vis[x][y]=true;
				if(c=='L'){
					ri[x][--y]=true;
				}else if(c=='R'){
					ri[x][y++]=true;
				}else if(c=='U'){
					dw[--x][y]=true;
				}else{
					dw[x++][y]=true;
				}
			}
			for(int i=1;i<=n;i++){
				for(int j=1;j<=m;j++){
					cout<<"o*"[(i==x1&&j==y1)||(i==x2&&j==y2)];
					if(j<m) for(int o:{0,1}) cout<<" -"[ri[i][j]];
				}
				cout<<'\n';
				if(i<n){
					for(int j=1;j<=m;j++){
						cout<<" |"[dw[i][j]];
						if(j<m) cout<<"  ";
					}
					cout<<'\n';
				}
			}
		}
	}
	cerr<<"Running time: "<<1.*clock()/CLOCKS_PER_SEC<<'\n';
	return 0;
}