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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] age)throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuffer sb = new StringBuffer();
		StringBuffer sb2 = new StringBuffer();

		String str = br.readLine();
		int q = Integer.parseInt(br.readLine());
		int z = 0;

		while( z<q ){
			String[] input = br.readLine().split(" ");

			if( input[0].equals("replace")){
				if( input[1].equals("0") && input[2].equals(Integer.toString(str.length()-1))){
					str = input[3];
				}else if( input[1].equals("0") ){
					sb.append(input[3]).append(str.substring(Integer.parseInt(input[2])+1, str.length()));
					str = sb.toString();
				}else if( input[2].equals(Integer.toString(str.length()-1)) ){
					sb.append(str.substring(0, Integer.parseInt(input[1]))).append(input[3]);
					str = sb.toString();
				}else{
					sb.append(str.substring(0, Integer.parseInt(input[1]))).append(input[3]).append(str.substring(Integer.parseInt(input[2])+1, str.length()));
					str = sb.toString();
				}
			}else if( input[0].equals("reverse") ){
				sb.append(str.substring(Integer.parseInt(input[1]), Integer.parseInt(input[2])+1));
				String rts = sb.reverse().toString();
				sb.setLength(0);

				if( input[1].equals("0") && input[2].equals(Integer.toString(str.length()-1))){
					str = rts;
				}else if( input[1].equals("0") ){
					sb.append(rts).append(str.substring(Integer.parseInt(input[2])+1, str.length()));
					str = sb.toString();
				}else if( input[2].equals(Integer.toString(str.length()-1)) ){
					sb.append(str.substring(0, Integer.parseInt(input[1]))).append(rts);
					str = sb.toString();
				}else{
					sb.append(str.substring(0, Integer.parseInt(input[1]))).append(rts).append(str.substring(Integer.parseInt(input[2])+1, str.length()));
					str = sb.toString();
				}
			}else if( input[0].equals("print") ){
				sb2.append(str.substring(Integer.parseInt(input[1]), Integer.parseInt(input[2])+1) ).append("\n");
			}
			sb.setLength(0);
			z++;
		}

		System.out.print(sb2);
	}
}