Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

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.

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.

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$

Sample Input 1

abcde
3
replace 1 3 xyz
reverse 0 2
print 1 4

Sample Output 1

xaze

Sample Input 2

xyz
3
print 0 2
replace 0 2 abc
print 0 2

Sample Output 2

xyz
abc

Solution in JavaScript (judge verdict: Accepted)

var input = ""
process.stdin.resume();
process.stdin.setEncoding('utf-8');
process.stdin.on('data', function(chunk) {
  input += chunk;
});
 
process.stdin.on('end', function() {
  input = input.split("\n");

  var text = input[0];
  var q = parseInt(input[1], 10);

  for (i = 2; i <= q + 2; i++) {
    var order = input[i].split(" ");
    var a = parseInt(order[1], 10);
    var b = parseInt(order[2], 10);

    switch (order[0]) {
      case "print":
        console.log(text.slice(a, b + 1));
        break;
      case "reverse":
        text = text.slice(0, a) + text.slice(a, b + 1).split("").reverse().join("")
                + text.slice(b + 1);
        break;
      case "replace":
        text = text.slice(0, a) + order[3] + text.slice(b + 1);
        break;
    }
  }
});