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.Text;

namespace AOJ
{
    class Program
    {
        static string replaceCommand(string targetString, string[] input)
        {
            var a = int.Parse(input[1]);
            var b = int.Parse(input[2]);
            var len = b - a + 1;
            var p = input[3].ToCharArray();
            var target = targetString.ToCharArray();

            if (false
                || (len != p.Length)
                || (targetString.Length < p.Length)
                )
            {
                throw new Exception("invalid replace input");
            }

            for (int i = 0; i < p.Length; ++i)
            {
                target[i + a] = p[i];
            }

            return string.Join("", target);
        }
        static string reverseCommand(string targetString, string[] input)
        {
            var a = int.Parse(input[1]);
            var b = int.Parse(input[2]);
            var len = b - a + 1;
            var target = targetString.ToCharArray();

            if (false
                || (targetString.Length < len)
                )
            {
                throw new Exception("invalid reverse input");
            }

            while (a < b)
            {
                var tmp = target[a];
                target[a] = target[b];
                target[b] = tmp;

                ++a;
                --b;
            }

            return string.Join("", target);
        }
        static string printCommand(string targetString, string[] input)
        {
            var a = int.Parse(input[1]);
            var b = int.Parse(input[2]);
            var len = b - a + 1;
            var target = targetString.ToCharArray();

            if (false
                || (targetString.Length < len)
                )
            {
                throw new Exception("invalid print input");
            }

            var subChars = new char[len];
            Array.Copy(target, a, subChars, 0, len);
            var outString = string.Join("", subChars);

            Console.Out.WriteLine(outString);

            return targetString;
        }

        static void Main(string[] args)
        {
            var targetString = Console.In.ReadLine();
            var countString = Console.In.ReadLine();
            var count = int.Parse(countString);

            Dictionary<string, Func<string, string[], string>> commands = new Dictionary<string, Func<string, string[], string>>();
            commands["replace"] = replaceCommand;
            commands["reverse"] = reverseCommand;
            commands["print"] = printCommand;

            for (int i = 0; i < count; ++i)
            {
                var command = Console.In.ReadLine();
                var splitStrings = command.Split(' ');
                targetString = commands[splitStrings[0]](targetString, splitStrings);
            }
        }
    }
}