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 PHP (judge verdict: Accepted)

<?php
$input = STDIN;

$str = trim(fgets($input));
$q = intval(trim(fgets($input)));

for ($i = 0; $i < $q; $i++) {
    $cmd = explode(' ', trim(fgets($input)));
    $a = intval($cmd[1]);
    $b = intval($cmd[2]);
    
    switch ($cmd[0]) {
        case 'print':
            print substr($str, $a, $b - $a + 1) . "\n";
            break;
        case 'reverse':
            $str = substr($str, 0, $a) .
            strrev(substr($str, $a, $b - $a + 1)) . substr($str, $b + 1);
            break;
        default:
        $str = substr($str, 0, $a) . $cmd[3] . substr($str, $b + 1);
            break;
    }
}