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;

class program
{

    public static void Main()
    {
        string str = Console.ReadLine();
        var q = int.Parse(Console.ReadLine());

        for (int i = 0; i < q; i++)
        {
            var query = Console.ReadLine().Split(' ');

            switch (query[0])
            {
                case "replace":
                    str = str.Replace(str.Substring(int.Parse(query[1]), int.Parse(query[2])), query[3]);
                    break;
                case "reverse":
                    string restr = "";
                    int a = int.Parse(query[1]);
                    int b = int.Parse(query[2]);
                    for (int j = 0, k = b; j < str.Length; j++)
                    {
                        if (a <= j && b >= j)
                        {
                            restr += str[k];
                            Console.WriteLine(k);
                            k--;                           
                        }
                        else
                        {
                            restr += str[j];
                            Console.WriteLine(j);
                        }
                    }
                    str = restr;
                        break;
                case "print":
                        Console.WriteLine(str.Substring(int.Parse(query[1]) , int.Parse(query[2]) - int.Parse(query[1]) + 1));
                    break;
            }
        }
    }
}