Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Transformation

Write a program which performs a sequence of commands to a given string $str$. The command is one of:

print a b: print from the a-th character to the b-th character of $str$

reverse a b: reverse from the a-th character to the b-th character of $str$

replace a b p: replace from the a-th character to the b-th character of $str$ with p

Note that the indices of $str$ start with 0.

Input

In the first line, a string $str$ is given. $str$ consists of lowercase letters. In the second line, the number of commands q is given. In the next q lines, each command is given in the above mentioned format.

Output

For each print command, print a string in a line.

Constraints

$1 \leq $ length of $str \leq 1000$

$1 \leq q \leq 100$

$0 \leq a \leq b < $ length of $str$

for replace command, $b - a + 1 = $ length of $p$

Sample Input 1

abcde
3
replace 1 3 xyz
reverse 0 2
print 1 4

Sample Output 1

xaze

Sample Input 2

xyz
3
print 0 2
replace 0 2 abc
print 0 2

Sample Output 2

xyz
abc

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String str = scanner.nextLine();
        int q = Integer.parseInt(scanner.nextLine());
        
        String tmp = str;
        for(int i=1; i<=q; i++){
            String input = scanner.nextLine();
            String inputArr[] = input.split(" ");
            
            int a = 0;
            int b = 0;
            String tmp1 = "";
            String tmp2 = "";
            String tmp3 = "";
            switch(inputArr[0]){
                case "print":
                    a = Integer.parseInt(inputArr[1]);
                    b = Integer.parseInt(inputArr[2]);
                    System.out.println(tmp.substring(a,b+1));
                    break;
                case "reverse":
                    a = Integer.parseInt(inputArr[1]);
                    b = Integer.parseInt(inputArr[2]);
                    tmp1 = tmp.substring(0,a);
                    tmp2 = tmp.substring(a,b+1);
                    tmp3 = tmp.substring(b+1,tmp.length());
                    StringBuffer sb = new StringBuffer(tmp2);
                    tmp = tmp1 + sb.reverse() + tmp3;
                    break;
                case "replace":
                    a = Integer.parseInt(inputArr[1]);
                    b = Integer.parseInt(inputArr[2]);
                    String p = inputArr[3];
                    
                    tmp1 = tmp.substring(0,a);
                    tmp3 = tmp.substring(b+1,tmp.length()); 
                    tmp = tmp1 + p + tmp3;
                    break;
            }
        }

    }
}