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 C# (judge verdict: Wrong Answer)

using System;

namespace AOJ.ITP
{
    public class Transformation
    {
        public static void Main()
        {
            string test = Console.ReadLine();
            int cnt = int.Parse(Console.ReadLine());
            for (int i = 0; i < cnt; i++)
            {
                var order = Console.ReadLine().Split(' ');
                int from = int.Parse(order[1]);
                int to = int.Parse(order[2]);
                if (order[0] == "print")
                {
                    Console.WriteLine(test.Substring(from, to - from - 1));
                }
                else if (order[0] == "reverse")
                {
                    // ループ回数
                    int loop = to - from + 1;
                    
                    string new_test = test.Substring(0, from);
                    for (int j = 0; j < loop; j++)
                    {
                        new_test += test.Substring(to - j, 1);
                    }
                    new_test += test.Substring(to + 1);
                    test = new_test;
                }
                else
                {
                    string after = order[3];
                    string new_test = test.Substring(0, to - from - 1);
                    new_test += after;
                    new_test += test.Substring(to + 1);
                    test = new_test;
                }
            }
        }
    }
}