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: Runtime Error)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main{

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String word = null;
		StringBuffer bf = new StringBuffer();
		List<String> list = new ArrayList<>();
		
		try {
			word = br.readLine();
			int q = Integer.parseInt(br.readLine());
			for (int i = 0; i < q; i++) {
				String[] order = br.readLine().split("\\s");
				int a = Integer.parseInt(order[1]);
				int b = Integer.parseInt(order[2]);
				if (order[0] != null) {
					switch (order[0]) {
					case "print" :
						list.add(word.substring(a, b+1));
						break;
					case "reverse" :	
						word = bf.append(word.substring(a, b+1)).reverse() + word.substring(b+1, word.length());
						bf.setLength(0);
						break;
					case "replace" :
						bf.append(word);
						word = (bf.replace(a, b+1, order[3])).toString();
						bf.setLength(0);
						break;
					default :
						break;
					}
				}
			}
			for (int i = 0; i < list.size(); i++) {
				System.out.println(list.get(i));
			}
			
		} catch (IOException e) {
			// TODO 自動生成された catch ブロック
			e.printStackTrace();
		}

	}

}