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 {

	static Scanner sc = new Scanner(System.in);
	static String st = sc.nextLine();
	static char[] str = st.toCharArray();
	public static void main(String[] args) {

		String order = null;
		int q = Integer.parseInt(sc.nextLine());

		for (int i = 0; i < q; i++) {
			order = sc.nextLine();

			String[] od = order.split(" ");

			switch(od[0]) {
				case("replace"):
					replace(od);
				continue;
				case("reverse"):
					reverse(od);
				continue;
				case("print"):
					print(od);
				continue;
				default:
				continue;
			}
		}


	}
	private static void print(String[] od) {
		int n = Integer.parseInt(od[1]);
		int m = Integer.parseInt(od[2]);

		for (int i = n; i <= m; i++) {
			System.out.print(str[i]);
		}
		System.out.println();

	}
	private static void reverse(String[] od) {
		int n = Integer.parseInt(od[1]);
		int m = Integer.parseInt(od[2]);
		char[] st_tmp = new char[m - n + 1];
		int j = 0;

		for (int i = n; i <= m; i++) {
			st_tmp[j] = str[i];
			j++;
		}

		j--;
		for (int i = n; i <= m; i++) {
			str[i] = st_tmp[j];
			j--;
		}

	}
	private static void replace(String[] od) {
		int n = Integer.parseInt(od[1]);
		int m = Integer.parseInt(od[2]);
		char[] st_rep = od[3].toCharArray();
		int j = 0;

		for (int i = n; i <= m; i++) {
			str[i] = st_rep[j];
			j++;
		}

	}

}