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.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String[] word = sc.next().split("",0);
        int times = sc.nextInt();
        for(int i = 0; i < times; i++){
            String test = sc.next();
            int num1 = sc.nextInt();
            int num2 = sc.nextInt();
            int count = 0;
            if(test.equals("replace")){
                String[] str = sc.next().split("",0);
                for(int j = num1; j <= num2; j++){
                    word[j] = str[count];
                    count++;
                }
            }
            else if(test.equals("reverse")){
                String[] reverse = new String[num2 - num1 + 1];
                for(int l = num2; l >= num1; l--){
                    reverse[count] = word[l];
                    count++;
                }
                count = 0;
                for(int m = num1; m <= num2; m++){
                    word[m] = reverse[count];
                    count++;
                }
            }
            else {
                for(int k = num1; k <= num2; k++){
                    System.out.print(word[k]);
                }
                System.out.println();
            }
        }
    }
}