Given a string S, and two numbers N, M - arrange the characters of string in between the indexes N and M (both inclusive) in descending order. (Indexing starts from 0).

Input Format:
First line contains T - number of test cases.
Next T lines contains a string(S) and two numbers(N, M) separated by spaces.

Output Format:
Print the modified string for each test case in new line.

Constraints:

• $1 \leq T \leq 1000$
• $1 \leq |S| \leq 10000$ // |S| denotes the length of string.
• $0 \leq N \leq M \lt |S|$
• $S \in [a,z]$