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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

  public static void main(String[] args) throws IOException {
    
    try( BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {

      String str = br.readLine();
      StringBuilder transStr = new StringBuilder(str);
      StringBuilder order = new StringBuilder();
      StringBuilder revese = new StringBuilder();
      int q = Integer.parseInt(br.readLine());
      int[] sep = new int[]{0,0,0};
      int start = 0;
      int end   = 0;

      for ( int i = 0; i < q; i++ ) {

        order.append(br.readLine());
        sep[0] = order.indexOf(" ");
        sep[1] = order.indexOf(" ",sep[0]+1);

        switch(order.substring(0,sep[0])) {
          case "replace" :
            sep[2] = order.indexOf(" ",sep[1]+1);
            start = Integer.parseInt(order.substring(sep[0]+1,sep[1]));
            end   = Integer.parseInt(order.substring(sep[1]+1,sep[2]))+1;
            transStr.replace(start, end, order.substring(sep[2]+1));
            break;
          case "reverse" :
            start = Integer.parseInt(order.substring(sep[0]+1,sep[1]));
            end   = Integer.parseInt(order.substring(sep[1]+1))+1;
            revese.append(transStr.substring(start, end))
                  .reverse();
            transStr.replace(start, end, revese.toString());
            revese.setLength(0);
            break;
          case "print" :
            start = Integer.parseInt(order.substring(sep[0]+1,sep[1]));
            end   = Integer.parseInt(order.substring(sep[1]+1))+1;
            System.out.println(transStr.substring(start,end));
            break;
          default :
            break;
        }

        order.setLength(0);
      }
    }
  }
}