Problem: You are an intergalactic surgeon and you have an alien patient. For the purposes of this problem, we can and we will model this patient's body using a 2 × (2k + 1) rectangular grid. The alien has 4k + 1 distinct organs, numbered 1 to 4k + 1.

In healthy such aliens, the organs are arranged in a particular way. For example, here is how the organs of a healthy such alien would be positioned, when viewed from the top, for k = 4:

<image>

Here, the E represents empty space. 

In general, the first row contains organs 1 to 2k + 1 (in that order from left to right), and the second row contains organs 2k + 2 to 4k + 1 (in that order from left to right) and then empty space right after. 

Your patient's organs are complete, and inside their body, but they somehow got shuffled around! Your job, as an intergalactic surgeon, is to put everything back in its correct position. All organs of the alien must be in its body during the entire procedure. This means that at any point during the procedure, there is exactly one cell (in the grid) that is empty. In addition, you can only move organs around by doing one of the following things:

  * You can switch the positions of the empty space E with any organ to its immediate left or to its immediate right (if they exist). In reality, you do this by sliding the organ in question to the empty space; 
  * You can switch the positions of the empty space E with any organ to its immediate top or its immediate bottom (if they exist) only if the empty space is on the leftmost column, rightmost column or in the centermost column. Again, you do this by sliding the organ in question to the empty space. 



Your job is to figure out a sequence of moves you must do during the surgical procedure in order to place back all 4k + 1 internal organs of your patient in the correct cells. If it is impossible to do so, you must say so.

Input

The first line of input contains a single integer t (1 ≤ t ≤ 4) denoting the number of test cases. The next lines contain descriptions of the test cases.

Each test case consists of three lines. The first line contains a single integer k (1 ≤ k ≤ 15) which determines the size of the grid. Then two lines follow. Each of them contains 2k + 1 space-separated integers or the letter E. They describe the first and second rows of organs, respectively. It is guaranteed that all 4k + 1 organs are present and there is exactly one E.

Output

For each test case, first, print a single line containing either:

  * SURGERY COMPLETE if it is possible to place back all internal organs in the correct locations; 
  * SURGERY FAILED if it is impossible. 



If it is impossible, then this is the only line of output for the test case. However, if it is possible, output a few more lines describing the sequence of moves to place the organs in the correct locations. 

The sequence of moves will be a (possibly empty) string of letters u, d, l or r, representing sliding the organ that's directly above, below, to the left or to the right of the empty space, respectively, into the empty space. Print the sequence of moves in the following line, as such a string. 

For convenience, you may use shortcuts to reduce the size of your output. You may use uppercase letters as shortcuts for sequences of moves. For example, you could choose T to represent the string lddrr. These shortcuts may also include other shortcuts on their own! For example, you could choose E to represent TruT, etc.

You may use any number of uppercase letters (including none) as shortcuts. The only requirements are the following:

  * The total length of all strings in your output for a single case is at most 10^4; 
  * There must be no cycles involving the shortcuts that are reachable from the main sequence; 
  * The resulting sequence of moves is finite, after expanding all shortcuts. Note that the final sequence of moves (after expanding) may be much longer than 10^4; the only requirement is that it's finite. 



As an example, if T = lddrr, E = TruT and R = rrr, then TurTlER expands to:

  * TurTlER
  * lddrrurTlER
  * lddrrurlddrrlER
  * lddrrurlddrrlTruTR
  * lddrrurlddrrllddrrruTR
  * lddrrurlddrrllddrrrulddrrR
  * lddrrurlddrrllddrrrulddrrrrr



To use shortcuts, print each one of them in a single line as the uppercase letter, then space, and then the string that this shortcut represents. They may be printed in any order. At the end of all of those, print a single line containing DONE. 

Note: You still need to print DONE even if you don't plan on using shortcuts.

Your sequence does not need to be the shortest. Any valid sequence of moves (satisfying the requirements above) will be accepted.

Example

Input


2
3
1 2 3 5 6 E 7
8 9 10 4 11 12 13
11
34 45 6 22 16 43 38 44 5 4 41 14 7 29 28 19 9 18 42 8 17 33 1
E 15 40 36 31 24 10 2 21 11 32 23 30 27 35 25 13 12 39 37 26 20 3


Output


SURGERY COMPLETE
IR
R SrS
S rr
I lldll
DONE
SURGERY FAILED

Note

There are three shortcuts defined in the first sample output:

  * R = SrS
  * S = rr
  * I = lldll



The sequence of moves is IR and it expands to:

  * IR
  * lldllR
  * lldllSrS
  * lldllrrrS
  * lldllrrrrr

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int tc;
  cin >> tc;
  while (tc--) {
    int k;
    cin >> k;
    int w = k * 2 + 1;
    vector<string> a[2];
    int ei, ej;
    for (int i = 0; i < 2; i++) {
      a[i].resize(w);
      for (int j = 0; j < w; j++) {
        cin >> a[i][j];
        if (a[i][j] == "E") ei = i, ej = j;
      }
    }
    string ans;
    while (a[1][k] != "E") {
      if (ej > k) {
        ans += 'l';
        swap(a[ei][ej], a[ei][ej - 1]);
        ej--;
      } else if (ej < k) {
        ans += 'r';
        swap(a[ei][ej], a[ei][ej + 1]);
        ej++;
      } else if (ei == 0) {
        ans += 'd';
        swap(a[ei][ej], a[ei + 1][ej]);
        ei++;
      } else
        assert(0);
    }
    map<string, pair<int, int>> lookup;
    lookup[to_string(k + 1)] = {-1, -1};
    for (int i = 0; i < k; i++) {
      lookup[to_string(k - i)] = {0, i + 1};
      lookup[to_string(k + 2 + i)] = {1, i + 1};
    }
    for (int i = 0; i < k; i++) {
      lookup[to_string(w + 1 + i)] = {0, k + 1 + i};
      lookup[to_string(k * 4 + 1 - i)] = {1, k + i + 1};
    }
    auto find = [&](string s) {
      assert(lookup.count(s));
      return lookup[s];
    };
    vector<pair<int, int>> l(w), r(w);
    for (int j = 0; j < k; j++) {
      l[j + k + 1] = find(a[1][j]);
      r[j + k + 1] = find(a[1][k * 2 - j]);
    }
    for (int j = 0; j <= k; j++) {
      l[j] = find(a[0][k - j]);
      r[j] = find(a[0][k + j]);
    }
    auto L = [&](int t) {
      t = (t % w + w) % w;
      for (int i = 0; i < t; i++) ans += 'L';
      auto nl = l;
      for (int i = 0; i < w; i++) nl[i] = l[(i + t) % w];
      swap(l, nl);
      r[0] = l[0];
    };
    auto R = [&](int t) {
      t = (t % w + w) % w;
      for (int i = 0; i < t; i++) ans += 'R';
      auto nr = r;
      for (int i = 0; i < w; i++) nr[i] = r[(i + t) % w];
      swap(r, nr);
      l[0] = r[0];
    };
    auto locate = [&](int s, int v) {
      for (int i = 0; i < w; i++)
        if (l[i] == make_pair(s, v)) return make_pair(0, i);
      for (int i = 0; i < w; i++)
        if (r[i] == make_pair(s, v)) return make_pair(1, i);
      assert(0);
      return make_pair(-2, -2);
    };
    auto reset = [&]() {
      auto [s, p] = locate(-1, -1);
      if (s)
        R(p);
      else
        L(p);
    };
    reset();
    L(1);
    while (1) {
      while (l[0].first == 0) L(1);
      if (l[0].first == -1) break;
      while (r[0].first == 1) R(1);
    }
    for (int i = 1; i < w; i++) {
      assert(l[i].first == 0);
      assert(r[i].first == 1);
    }
    {
      int flip = 1, stored = -1;
      for (int i = 1; i < w; i++) {
        if (stored != i) {
          auto [s, p] = locate(1, i);
          assert(s == 1);
          R(p);
          assert(l[0].second == i);
          L(flip);
          R(-p);
          flip *= -1;
          stored = i;
        } else {
          assert(locate(1, i).first == 0);
        }
        R(i);
        stored = l[0].first == 1 ? l[0].second : -1;
        L(flip);
        R(-i);
        flip *= -1;
      }
    }
    for (int i = 1; i < w; i++) {
      assert(r[i].first == 1 && r[i].second == i);
    }
    int ok = 1;
    {
      int flip = 1, stored = -1;
      for (int i = 1; i < w; i++) {
        if (stored != i) {
          auto [s, p] = locate(0, i);
          assert(s == 0);
          L(p);
          assert(r[0].second == i);
          R(flip);
          L(-p);
          flip *= -1;
          stored = i;
        }
        L(i);
        stored = r[0].first == 0 ? r[0].second : -1;
        R(flip);
        L(-i);
        flip *= -1;
      }
      if (flip == -1) {
        ok = 0;
      }
    }
    if (!ok) {
      cout << "SURGERY FAILED" << endl;
      continue;
    }
    for (int i = 1; i < w; i++) {
      assert(l[i].first == 0 && l[i].second == i);
      assert(r[i].first == 1 && r[i].second == i);
    }
    assert(l[0] == make_pair(-1, -1));
    assert(r[0] == make_pair(-1, -1));
    while (ej < 2 * k) {
      ans += 'r';
      swap(a[ei][ej], a[ei][ej + 1]);
      ej++;
    }
    cout << "SURGERY COMPLETE" << endl;
    cout << ans << endl;
    cout << "L ";
    cout << 'u';
    for (int i = 0; i < k; i++) cout << 'l';
    cout << 'd';
    for (int i = 0; i < k; i++) cout << 'r';
    cout << endl;
    cout << "R ";
    cout << 'u';
    for (int i = 0; i < k; i++) cout << 'r';
    cout << 'd';
    for (int i = 0; i < k; i++) cout << 'l';
    cout << endl;
    cout << "DONE" << endl;
  }
}