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.

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$

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.

Examples

Input

abcde
3
replace 1 3 xyz
reverse 0 2
print 1 4


Output

xaze


Input

xyz
3
print 0 2
replace 0 2 abc
print 0 2


Output

xyz
abc


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		StringBuilder str = new StringBuilder();
		
		String line;
		String[] imperative;
		int a;
		int b;
		
		str.append(scan.nextLine());
		int turns = Integer.parseInt(scan.nextLine());
		
		for (int i = 0; i < turns; i++) {
			line = scan.nextLine();
			imperative = line.split(" ");
			//imperative[1] => a?????????
			a = Integer.parseInt(imperative[1]);
			//imperative[2] => b?????????
			b = Integer.parseInt(imperative[2]) + 1;
			
			if(imperative[0].equals("print")){
				//??????=>print ??§????????°??¨???
				System.out.println(str.substring(a, b));
			}else if(imperative[0].equals("reverse")){
				//??????=>reverse ??§????????°
				//str??§?????¢?????????????±?????????????reverse??????????????????????????¢?????????str???????????????
				StringBuilder reverse = new StringBuilder();
				reverse.append((str.substring(a, b)));
				str.replace(a, b, (reverse.reverse()).toString());
			}else{
				//?????????print???reverse ??§???????????????????????????
				str.replace(a, b, imperative[3]);
			}
			
		}
		
	}
}