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: Accepted)

using System;

namespace _9_D
{
    class Program
    {
        static void Main(string[] args)
        {
            string s = Console.ReadLine();
            char[] str = new char[s.Length];
            for (int i = 0; i < s.Length; i++)
            {
                str[i] = s[i];
            }
            int n = int.Parse(Console.ReadLine());
            for (int i = 0; i < n; i++)
            {
                string[] x = Console.ReadLine().Split();
                if (x[0] == "print")
                {
                    for (int j = int.Parse(x[1]); j <= int.Parse(x[2]); j++)
                    {
                        Console.Write(str[j]);
                    }
                    Console.WriteLine();
                }
                else if (x[0] == "replace")
                {
                    int a = 0;
                    for (int j = int.Parse(x[1]); j <= int.Parse(x[2]); j++)
                    {
                        str[j] = x[3][a];
                        a++;
                    }
                }
                else
                {
                    char[] now = new char[int.Parse(x[2]) - int.Parse(x[1]) + 1];
                    int a = 0;
                    for (int j = int.Parse(x[1]); j <= int.Parse(x[2]); j++)
                    {
                        now[a] = str[j];
                        a++;
                    }
                    a = 0;
                    Array.Reverse(now);
                    for (int j = int.Parse(x[1]); j <= int.Parse(x[2]); j++)
                    {
                        str[j] = now[a];
                        a++;
                    }
                }
            }
        }
    }
}