#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int a[4];
char s[N];
pair<int,int> g(int x,int d) {
	if(x==0) return make_pair(0,d);
	else if(x==1) return make_pair(0,-d);
	else if(x==2) return make_pair(-d,0);
	else return make_pair(d,0);
}
void print(int x) {
	char c;
	if(x==0)c='U';
	if(x==1)c='D';
	if(x==2)c='L';
	if(x==3)c='R';
	int t=a[x];
	while(t--)putchar(c);
}
int p[4];
void get() {
	int x,y,i;
	cin>>x>>y; memset(a,0,sizeof(a));
	cin>>(s+1); int n=strlen(s+1);
	if(x==0&&y==0) return puts("Impossible"),void();
	for(i=1;i<=n;i++) {
		switch(s[i]) {
			case 'U': a[0]++; break;
			case 'D': a[1]++; break;
			case 'L': a[2]++; break;
			case 'R': a[3]++; break;
		}
	}
	for(i=0;i<4;i++) p[i]=i;
	int ok=0;
	do {
		int d=0,q=0,np,nq,ans=1;
		for(i=0;i<4;i++) {
			auto tmp=g(p[i],a[p[i]]);
			np=d+tmp.first,nq=q+tmp.second;
			if(d==np&&d==x&&((q<=y&&y<=nq)||(nq<=y&&y<=q))) ans=0;
			d=np,q=np;
		}
		if(ans) {
			for(i=0;i<4;i++) print(p[i]); putchar('\n');
			ok=1;
			break;
		}
	} while(next_permutation(p,p+4));
	if(!ok) puts("Impossible");
}
int main() {
	int T; cin>>T;
	while(T--) get();
	return 0;
}