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.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		String[] c;
		c = new String[10000];
		String x = scan.next();
		String mj[] = x.split("");
		int a = scan.nextInt();
		int i,m,b;
		for(i = 1; i <= a; ++i){
			b = 0;
			String str = scan.next();
			int q = scan.nextInt();
			int w = scan.nextInt();
			
			if(str.equals("replace")){
				String e = scan.next();
				String j[] = e.split("");
				for(m = q; m <= w; ++m){
					mj[m] = j[b++];
				}
			}
				else if(str.equals("reverse")){
				for(m = q; m <= w; ++m){
					c[b++] = mj[m];
				}
				b = 0;
				for(m = w; m >= q; --m){
					mj[m] = c[b++];
				}
				}
				else if(str.equals("print")){
				for(m = q; m <= w; ++m){
					System.out.print(mj[m]);
				}
				System.out.println("");
				}
			}
		}
	}