uva 652

用BFS+HASH壓過去了

還好沒有TLE

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <string>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 30005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
char str[10];
map<string,string> hsh;
int d[]={1,-1,3,-3};
char od[]={'l','r','u','d'};
struct st{
    char str[10];
    int id;
    char order[1000];
    int ornum;
};
void pre(){
    st stmp;
    strcpy(stmp.str,"12345678x");
    stmp.ornum=0;
    stmp.id=8;
    queue<st> q;
    q.push(stmp);
    char ans[10000];
    while(!q.empty()){
        st now=q.front();
//        puts(now.str);
        now.order[now.ornum]=0;
        q.pop();
        st nst=now;
        for(int i=0;i<4;i++){
            if(((now.id==2)||(now.id==5)||(now.id==8))&&i==0)continue;
            if(((now.id==0)||(now.id==3)||(now.id==6))&&i==1)continue;
            int nid=d[i]+now.id;
            if(nid>=9||nid<0)continue;
            nst.id=nid;
            swap(nst.str[nid],nst.str[now.id]);
            nst.order[nst.ornum++]=od[i];
            nst.order[nst.ornum]=0;
            if(!hsh.count(nst.str)){
                q.push(nst);
                hsh[nst.str]=nst.order;
            }
            nst.ornum--;
            swap(nst.str[nid],nst.str[now.id]);
        }
    }
//    puts(ans);
}
int main() {
    ios_base::sync_with_stdio(0);
    pre();
    int test;
    char cle[20];
    scanf("%d%*c",&test);

    while(test--){
        for(int i=0;i<9;i++){
            scanf(" %c",&str[i]);
        }
//        puts(str);
        if(hsh.count(str)){
            string ans=hsh[str];
            for(int i=ans.length()-1;i>=0;i--){
                printf("%c",ans[i]);
            }putchar('\n');
        }
        else puts("unsolvable");
        if(test)Pln();
    }

















}