#include<bits/stdc++.h>
const int N=1e3+10;
const int M=2e6+10;
#define int long long
typedef double db;
typedef long long ll;
using namespace std;
using pii = pair<int,int>;
#define up(i,a,b) for(int i=(a);i<=(b);++i)
#define down(i,a,b) for(int i=(a);i>=(b);--i)
#define puts(a) (cout<<a<<endl)
#define inf (0x7fffffff)
const int MOD=100003;
int mx,my;
int a[4] = {0,1,2,3};
int dir[4] = {0};
int op[4][2] = {{0,1},{0,-1},{-1,0},{1,0}};
map<int,string>mp;
bool check(){
    int x = 0,y = 0;
    for(int i = 0;i < 4;i++){
        for(int j = 0;j < dir[a[i]];j++){
            x+=op[a[i]][0];
            y+=op[a[i]][1];
            if(x == mx&&y == my)
                return false;
        }
    }
    return true;
}


void solve(){
    mp[0] = 'U',mp[1] = 'D',mp[2] = 'L',mp[3] = 'R';

        cin >> mx >> my;
        string s;
        cin >> s;
        int x = 0,y = 0;
        memset(dir,0,sizeof(dir));
        a[0] = 0,a[1] = 1,a[2] = 2,a[3] = 3;
        for(int i = 0;i < s.size();i++){
            if(s[i] == 'U'){
                dir[0]++;
                y++;
            }
            if(s[i] == 'D'){
                dir[1]++;
                y--;
            }
            if(s[i] == 'L'){
                dir[2]++;
                x--;
            }
            if(s[i] == 'R'){
                dir[3]++;
                x++;
            }
        }
        if((mx == 0&&my == 0)||(x == mx&&y == my)){
            cout << "Impossible\n";
            return ;
        }
        bool finds = 0;
        bool flag=1;
        while(flag){

            if(check()){
                finds = 1;
                for(int i = 0;i < 4;i++){
                    for(int j = 0;j< dir[a[i]];j++)
                        cout<<mp[a[i]];
                }
                cout<<endl;
                break;
            }
            if(!next_permutation(a,a+4))
                flag=0;
        }

        if(!finds)
            cout << "Impossible\n";

}


signed main() {
int T;
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
    T=1;
    cin>>T;
    while(T--)
    solve();
    return 0;
}