/*************map存路径，set判重，string存状态*****************/

 /*********************暴力广搜 + STL **************************/

 #include<stdio.h>

 #include<iostream>

 #include<queue>

 #include<map>

 #include<set>

 #include<algorithm>

 #include<sstream>

 using namespace std;

 map<string, string>slu;

 set<string>visited;

 int dir[][] = { {-,},{,},{,},{,-} };

 string base = "udrl";

 char input[];

 struct node {

     string sta;

     string path;

     int pos;                //x所在的位置

     node(string stas, string paths, int poss) {

         sta = stas;

         path = paths;

         pos = poss;

     }

 };

 bool check(int x, int y)

 {

     if (x >=  && x <  && y >=  && y < )

         return true;

     else

         return false;

 }

 void prv_bfs()

 {

     queue<node>q;

     set<string>v;

     q.push(node("12345678x", "", ));        //从目标状态往回扩展

     slu["12345678x"] = " ";

     v.insert("12345678X");

     while (!q.empty())

     {

         struct node h = q.front();

         q.pop();

         int a =  h.pos / ;

         int b = h.pos % ;            //得到x的坐标

         for (int i = ; i < ; i++)

         {

             int x = a + dir[i][];

             int y = b + dir[i][];

             int pos =  * x + y;

             if (!check(x, y))

                 continue;

             swap(h.sta[h.pos], h.sta[pos]);

             if (slu.find(h.sta) != slu.end())

             {

                 swap(h.sta[h.pos], h.sta[pos]);

                 continue;

             }

             q.push(node(h.sta, h.path + base[i], pos));

             slu[h.sta] = h.path + base[i];

             v.insert(h.sta);

             swap(h.sta[h.pos], h.sta[pos]);

         }

     }

 }

 int main()

 {

     prv_bfs();

     while (~scanf("%s", input))

     {

         string line = "";

         line = line + input[];

         for (int i = ; i <= ; i++)

         {

             scanf("%s", input);

             line = line + input[];

         }

         if (slu[line] == "") cout << "unsolvable" << endl;

         else cout << slu[line] << endl;

     }

     return ;

 }