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;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace _1_9_d
{
    class Program
    {
        static void Main(string[] args)
        {
            string str = Console.ReadLine();
            int q = int.Parse(Console.ReadLine());
            for (int i = 0; i < q; i++)
            {
                string[] s = Console.ReadLine().Split(' ');
                string program = s[0];
                int a = int.Parse(s[1]);
                int b = int.Parse(s[2]);
                string p = "";
                List<string> answer = new List<string>();

                string ab = str.Substring(0, a);
                string bc = str.Substring(a, b - a + 1);
                string cd = str.Substring(b + 1);

                if (program == "print")
                {
                    Console.WriteLine(bc);
                }
                else if (program == "reverse")
                {
                    str = ab+ string.Join("", bc.Reverse()) + cd;
                }
                else
                {
                    p = s[3];
                    System.Text.StringBuilder replace = new System.Text.StringBuilder(str);
                    replace.Replace(str.Substring(a, b - a + 1), p, a, b - a + 1);
                    str = replace.ToString();
                }
                //foreach (string item in answer)
                //    Console.WriteLine(item);
            }
        }
    }
}