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.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		
		String str = sc.nextLine();
		int n = sc.nextInt();
		for (int i = 0; i < n; i++) {
			String ope = sc.next();
			int start = sc.nextInt();
			int end = sc.nextInt();
			if (ope.equals("replace")) {
				String tmp = sc.next();
				String A = str.substring(0, start);
				String B = str.substring(end+1);
				str = A + tmp + B;
			} else if (ope.equals("reverse")) {
				String A = str.substring(0, start);
				String B = str.substring(end+1);
				String C = str.substring(start, end+1);
				str = A;
				for (int j = 0; j < C.length(); j++) {
					str += "" + C.charAt(C.length()-i-1);
				}
				str += B;
			} else {
				System.out.println(str.substring(start, end+1));
			}
			System.out.println(str);
		}
	}
}