Description

Mr. Kuo is an adventurer. One day, he finds a secret room in a cave.

There is some hint to the password of this room.

 

Mr. Kuo is given an integer N and a string S = s₁s₂...s_N consisting of L, R, F, and B.

At first, Mr. Kuo has a string A = "0".

For each i = 1, 2, ..., N :

• If s_i is L, insert i to the left the "number" of i - 1 in A.
• If s_i is R, insert i to the right the "number" of i - 1 in A.
• If s_i is F, insert i to the front of A.
• If s_i is B, insert i to the back of A.

 

The final contents of A is the password. Please help Mr. Kuo find the password.

 

For example, N = 6 and S = "LRFRLB", then：

• s₁ = L, insert 1 to the left of 0, A = "10".
• s₂ = R, insert 2 to the right of 1, A = "120".
• s₃ = F, insert 3 to the front, A = "3120".
• s₄ = R, insert 4 to the right of 3, A = "34120".
• s₅ = L, insert 5 to the left of 4, A = "354120".
• s₆ = B, insert 6 to the back of A, A = "3541206".

 

Input

The first line contains one integer T — the number of test cases. Description of the test cases follows.

The first line of each test cases contains an integer N.

The second line of each test cases contains a string S consisting of L, R, F, and B of length N.

 

For each test：

1. T ≤ 100, N ≤ 100, S consists of L and R.
2. T ≤ 100, N ≤ 1000, S consists of L and R.
3. T ≤ 100, N ≤ 10000, S consists of L and R.
4. T ≤ 100, N ≤ 1000, S consists of L, R, F, and B.
5. T ≤ 100, N ≤ 10000, S consists of L, R, F, and B.
6. T ≤ 10, N ≤ 100000, S consists of L, R, F, and B.

 

Output

For each test case print a string A — the final contents of the password, seperated by spaces.

 

Sample Input  Download

Sample Output  Download

Tags

Discuss