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
#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main() {
	string str, o, p, m, str2;
	int i, q, a, b, j, x, c;
	cin >> str >> q;
	for (i = 0; i<q; i++) {
		cin >> o;
		if (o == "print") {
			cin >> a >> b;
			for (j = a; j <= b; j++)
				cout << str[j];
			cout << endl;
		}
		else if (o == "reverse") {
			cin >> a >> b;
			reverse(str.begin()+a,str.begin()+b+1);
		}
        else if (o == "replace") {
			cin >> a >> b >> p;
			str.replace(a,b-a+1,p);
		}
	}
}