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: Time Limit Exceeded)

// ITP1_9_D Transformation
import java.io.*;

class Main {

   static String str;

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

      try {
         str = br.readLine();
         int q = Integer.parseInt(br.readLine());
         for (int i = 0; i < q; i++) {
            String[] inst = br.readLine().split(" ");
            int a = Integer.parseInt(inst[1]);
            int b = Integer.parseInt(inst[2]);
            if (inst[0].equals("print"))  print(a, b);
            else if (inst[0].equals("reverse")) reverse(a, b);
            else if (inst[0].equals("replace")) replace(a, b, inst[3]);
         }
      }

      catch (Exception e) {
         System.err.println(e);
      }
   }

   static void print(int a, int b) {
      System.out.println(str.substring(a, b + 1));
   }

   static void reverse(int a, int b) {
      char[] ch = str.toCharArray();
      int x = a;
      int y = b;
      char tmp;
      while (x < y) {
         tmp = ch[y];
         ch[y] = ch[x];
         ch[x] = tmp;
      }
      str = String.valueOf(ch);
   }

   static void replace(int a, int b, String p) {
      str = str.replaceAll(str.substring(a, b + 1), p); 
   }
}