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.util.HashMap;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.regex.Pattern;
import java.util.Collections;
import java.math.BigDecimal;
import java.util.LinkedList;

public class Main {
    public static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) throws Exception {
        String s = sc.next();
        int n = sc.nextInt();
        
        for (int i = 0; i < n; i++) {
            String cmd = sc.next();
            switch (cmd) {
            case "print":
                print(s, sc.nextInt(), sc.nextInt());
                break;
            case "reverse":
                s = reverse(s, sc.nextInt(), sc.nextInt());
                break;
            case "replace":
                s = replace(s, sc.nextInt(), sc.nextInt(), sc.next());
                break;
            }
        }
    }
    
    static void print(String s, int a, int b) {
        System.out.println(s.substring(a, b+1));
    }
    
    static String reverse(String s, int a, int b) {
        StringBuilder sb = new StringBuilder();
        for (int i = b; i >= a; i--) {
            sb.append(s.substring(i, i+1));
        }
        return s.substring(0, a) + sb.toString() + s.substring(b+1, s.length());
    }
    
    static String replace(String s, int a, int b, String p) {
        return s.replace(s.substring(a, b+1), p);
    }
}