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;

class Command {

	private String method;
	private int a;
	private int b;
	private String p;

	public Command(String input) {
		super();

		String[] parts = input.split(" ");

		this.method = parts[0];
		this.a = Integer.parseInt(parts[1]);
		this.b = Integer.parseInt(parts[2]);

		if(parts.length == 4) this.p = parts[3];
	}

	public String doMethod(String str) {

		switch (this.method) {
		case "print":

			System.out.println(str.substring(a, b+1));
			break;

		case "reverse":

			char[] reverse = new char[str.length()];
			for (int i = 0; i < str.length(); i++) {
				if(a <= i && i <= b) {
					reverse[i] = str.charAt(b-(i-a));
				} else {
					reverse[i] = str.charAt(i);
				}
			}
			str = new String(reverse);
			break;

		case "replace":

			char[] replace = new char[str.length()];
			for (int i = 0; i < str.length(); i++) {
				if(a <= i && i <= b) {
					replace[i] = p.charAt(i-a);
				} else {
					replace[i] = str.charAt(i);
				}
			}
			str = new String(replace);
			break;

		default:
			break;
		}

		return str;
	}
}

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		String str = sc.nextLine();
		int num = sc.nextInt();
		sc.nextLine();

		Command[] commands = new Command[num];
		for (int i = 0; i < num; i++) {

			String input = sc.nextLine();
			commands[i] = new Command(input);

		}
		sc.close();

		for(Command command : commands) {
			str = command.doMethod(str);
		}

	}
}