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>
using namespace std;

int main() {
	int c,p,q,r,i,j;
	string a,b,t,s;
	cin >> a >> c;
	for (i = 0; i < c; i++) {
		cin >> b;
		if (b == "print") {
			cin >> p >> q;
			cout << a.substr(p, q - p + 1)<<endl;
		}
		if (b == "reverse") {
			cin >> p >> q;
			t = a.substr(p, q - p + 1);
			for (j = 0; j < q - p + 1;j++) {
				a.replace(p+j, 1, t.substr(q - p - j,1));
			}
		}
		if (b == "replace") {
			cin >> p >> q >> s;
			a.replace(p, q - p + 1, s);
		}
	}
	return 0;
}