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: Wrong Answer)

import java.io.IOException;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner scan = new Scanner(System.in);
        String str = scan.next();
        int orderNum = scan.nextInt();
        int a = 0;
        int b = 0;

        for (int i = 0; i < orderNum; i++){
            String order = scan.next();

            if (order.equals("print")){
                a = scan.nextInt();
                b = scan.nextInt();

                String printResult = str.substring(a, b + 1);
                System.out.println(printResult);
            }

            if (order.equals("reverse")){
                a = scan.nextInt();
                b = scan.nextInt();

                char[] strReverse = str.toCharArray();

                for (int j = 0; j < b - a; j++){
                    char tmp = strReverse[j + a];
                    strReverse[j + a] = strReverse[b - j];
                    strReverse[b - j] = tmp;
                }
                str = String.valueOf(strReverse);
            }

            if (order.equals("replace")){
                a = scan.nextInt();
                b = scan.nextInt();
                String strReplaceWord = scan.next();
                char[] strReplace = str.toCharArray();
                char[] strReplaceWordChara = strReplaceWord.toCharArray();

                for (int j = 0; j < strReplaceWordChara.length; j++){
                	strReplace[a + j] = strReplaceWordChara[j];
                }
                str = String.valueOf(strReplace);
            }
        }
        scan.close();
    }
}