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


public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in); 

		char[] str = sc.next().toCharArray();
		int q = sc.nextInt();
		
		for (int i = 0; i < q; i++) {
			String cmd = sc.next();
			int a = sc.nextInt();
			int b = sc.nextInt();

			if (cmd.equals("print")) {
				StringBuffer result = new StringBuffer();
				for (int j = a; j <= b; j++) {
					result.append(str[j]);
				}
				System.out.println(result);
			} else if (cmd.equals("reverse")) {
				for (int j = a, k = b; j < k; j++, k--) {
					char temp = str[j];
					str[j] = str[k];
					str[k] = temp;
				}
			} else if (cmd.equals("replace")) {
				char[] p = sc.next().toCharArray();
				for (int j = a, k = 0; j <= b; j++, k++) {
					str[j] = p[k];
				}
			}
		}

		sc.close();
	}
}