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 Transformation
{
    class Program
    {
        static void Main(string[] args)
        {
            string input = Console.ReadLine();
            List<string> inputList = new List<string>();

            foreach (char item in input)
            {
                inputList.Add(item.ToString());
            }

            int row = int.Parse(Console.ReadLine());

            for (int i = 0; i < row; i++)
            {
                string[] temp = Console.ReadLine().Split(' ');
                int idx1 = int.Parse(temp[1]);
                int idx2 = int.Parse(temp[2]);

                if (temp[0].Equals("replace"))
                {
                    int count = idx1;
                    foreach (char item in temp[3])
                    {
                        inputList.Insert(count, item.ToString());
                        ++count;
                    }
                    
                    for (int j = 0; j <= idx2 - idx1; ++j)
                    {
                        inputList.RemoveAt(idx2+1);
                    }
                }
                else if (temp[0].Equals("reverse"))
                {
                    for (int j = 0; j <= 2*(idx2 - idx1); j+=2)
                    {
                        inputList.Insert(idx1, inputList[idx1 + j]);
                    }

                    for (int j = 0; j <= idx2 - idx1; ++j)
                    {
                        inputList.RemoveAt(idx2+1);
                    }
                }
                else
                {
                    for (int j = idx1; j <= idx2; ++j)
                    {
                        Console.Write(inputList[j]);
                    }
                    Console.WriteLine();
                }
            }
        }
    }
}