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);
		String str = sc.next();
		int q =sc.nextInt();
		for(int i = 0; i < q; i++) {
			String command = sc.next();
			
			switch(command) {
				case "print": {
					int a =sc.nextInt();
					int b =sc.nextInt();
					pr(a, b, str);
					break;
				}
				case "reverse": {
					int a =sc.nextInt();
					int b =sc.nextInt();
					str = rv(a, b, str);
					break;
				}
				case "replace": {
					int a =sc.nextInt();
					int b =sc.nextInt();
					String p = sc.next();
					str = rp(a, b, p, str);
					break;
				}
			}
		}
		sc.close();
	}
	
	//printメソッド
	static void pr(int a, int b, String str) {
		if(b < str.length()) {
			System.out.println(str.substring(a, b + 1));
		} else {
			System.out.println(str.substring(a));
		}
	}
	//reverseメソッド
	static String rv(int a, int b, String str) {
		if (b < str.length()) {
			String f = str.substring(0, a);
			String l = str.substring(b + 1);
			StringBuilder c = new StringBuilder(str.substring(a, b + 1));
			StringBuilder sb = new StringBuilder();
			sb.append(f);
			sb.append(c.reverse().toString());
			sb.append(l);
			return(sb.toString());
		} else {
			String f = str.substring(0, a);
			StringBuilder c = new StringBuilder(str.substring(a));
			StringBuilder sb = new StringBuilder();
			sb.append(f);
			sb.append(c.reverse().toString());
			return(sb.toString());
		}
	}
	//replaceメソッド
	static String rp(int a, int b, String p, String str) {
		if (b < str.length()) {
			String f = str.substring(0, a);
			String l = str.substring(b + 1);
			StringBuilder sb = new StringBuilder();
			sb.append(f);
			sb.append(p);
			sb.append(l);
			return(sb.toString());
		} else {
			String f = str.substring(0, a);
			StringBuilder sb = new StringBuilder();
			sb.append(f);
			sb.append(f);
			return(sb.toString());
		}
	}
}