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[] args){
		BufferedReader insBR = new BufferedReader(new InputStreamReader(System.in));
		try{

			String strLine = insBR.readLine();

			String strNum = insBR.readLine();
			int intNum = Integer.parseInt(strNum);

			for(int i = 0; i < intNum; i++){

				String[] strOrder = insBR.readLine().split(" ");
				int intFirst = Integer.parseInt(strOrder[1]);
				int intSecond = Integer.parseInt(strOrder[2]);

				if("print".equals(strOrder[0])){
					intSecond += 1;
					String strPrint = strLine.substring(intFirst, intSecond);
					System.out.println(strPrint);

				}else if("reverse".equals(strOrder[0])){

					String[] strReverse = strLine.split("");
					for(int j = intFirst; j < intSecond; j++){
						String strAct = strReverse[j];
						strReverse[j] = strReverse[intSecond];
						strReverse[intSecond] = strAct;
						intSecond--;
					}

					strLine = "";
					for(int j = 0; j < strReverse.length; j++){
						strLine += strReverse[j];
					}
					//System.out.println("reverse = " + strLine);

				}else{
					intSecond += 1;
					String strAct = strLine.substring(intFirst, intSecond);
					//System.out.println("置き換える対象は、" + strAct);
					StringBuilder sb = new StringBuilder();
					sb.append(strLine);
					sb.replace(intFirst, intSecond,strOrder[3]);
					//strLine = strLine.replaceFirst(strAct, strOrder[3]);
					strLine = sb.toString();
					//System.out.println("replace = " + strLine);
				}
			}

		}catch(IOException e){
			e.printStackTrace();
		}catch(NumberFormatException e){
			e.printStackTrace();
		}

	}

}