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 {

	enum ORDER {
		print, reverse, replace;
	}

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

		String str = sc.nextLine();
		int orderCount = Integer.parseInt(sc.nextLine());
		for (int i = 0; i < orderCount; i++) {
			String[] orderStr = sc.nextLine().split("[\\s]+");
			ORDER order = ORDER.valueOf(orderStr[0]);
			switch (order) {
			case print:
				Print(str, orderStr[1], orderStr[2]);
				break;
			case reverse:
				str = Reverse(str, orderStr[1], orderStr[2]);
				break;
			case replace:
				str = Replace(str, orderStr[1], orderStr[2], orderStr[3]);
			}
		}

	}

	static void Print(String str, String a, String b) {
		System.out.print(str.substring(Integer.parseInt(a), Integer.parseInt(b) + 1));
	}

	static String Reverse(String str, String a, String b) {
		char[] carray = str.toCharArray();
		int start = Integer.parseInt(a), end = Integer.parseInt(b);
		for (int i = start; i <= (start + end) / 2; i++) {
			char work = carray[end - i];
			carray[end - i] = carray[i];
			carray[i] = work;
		}
		return carray.toString();
	}

	static String Replace(String str, String a, String b, String c) {
		String result = str.substring(0, Integer.parseInt(a));
		result += c;
		if (Integer.parseInt(b) + 1 != str.length()) {
			result += str.substring(Integer.parseInt(b) + 1);
		}
		return result;
	}

}