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

public class Main{

	public static void main(String[] args) throws IOException
	{
		int a,b,q;
		String str;

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in) );

		str = br.readLine();

		q = Integer.parseInt(br.readLine() );

		for(int i=0; i<q; i++)
		{
			String[] strSplit = br.readLine().split(" ");

			a = Integer.parseInt(strSplit[1]);
			b = Integer.parseInt(strSplit[2]) + 1;

			if(strSplit[0].equals("replace") )
			{
				StringBuffer sb_rep = new StringBuffer(str).replace(a, b, strSplit[3]);
				str = sb_rep.toString();
			}
			else if(strSplit[0].equals("reverse") )
			{
				StringBuffer sb_str = new StringBuffer(str);
				StringBuffer sb_rev = new StringBuffer(str.substring(a, b) );

				sb_rev = sb_rev.reverse();

				StringBuffer sb_revp = sb_str.replace(a, b, sb_rev.toString() );
				str = sb_revp.toString();
			}
			else if(strSplit[0].equals("print") )
			{
				System.out.println(str.substring(a, b) );
			}

		}
		
	}
}