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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
class Main {
	public static void main(String...args) throws IOException {
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str = br.readLine();
		int times = Integer.valueOf(br.readLine());

		for(int i = 0; i < times; i++) {
			String[] command = br.readLine().split(" ");
			int start = Integer.valueOf(command[1]);
			int end   = Integer.valueOf(command[2]);
			switch(command[0]) {
				case "replace" :
					String replace = command[3];
					str = str.substring(0 , start) + replace + str.substring(end + 1, str.length());
					break;
				case "reverse" :
					StringBuffer rStr = new StringBuffer(str.substring(start , end + 1));
					str = str.substring(0 , start) + rStr.reverse().toString() + str.substring(end + 1, str.length());
					break;
				case   "print" :
					System.out.println(str.substring(start , end + 1));
					break;
		    }
	    }
    }
}

