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: Runtime Error)

using System;

namespace ITP1_9_D
{
    class Program
    {
        static void Main(string[] args)
        {

            string str = Console.ReadLine();
            string str_rev = null;
            int num = int.Parse(Console.ReadLine());

            for (int i=0; i<num; i++)
            {
                string[] input = Console.ReadLine().Split(' ');
                string operate = input[0];
                string str_for = "";
                string str_back = "";
                int a = int.Parse(input[1]);
                int b = int.Parse(input[2]);
                int len = b - a + 1;

                switch (operate)
                {
                    case "print":                      
                        string output = str.Substring(a, len);
                        Console.WriteLine(output);

                        break;
                    
                    case "reverse":
                        if (a != 0)
                        {
                            str_for = str.Substring(0, (a - 1));
                        }
                        if (b != str.Length)
                        {
                            str_back = str.Substring((b + 1), (str.Length - len));
                        }

                        string str_sub = str.Substring(a, len);
                        char[] cs = str_sub.ToCharArray();
                        Array.Reverse(cs);
                        str_rev = new string(cs); 

                        str = str_for + str_rev + str_back;

                        break;
       
                    case "replace":
                        char[] str_cs = str.ToCharArray();
                        char[] cs2 = input[3].ToCharArray();
                        for (int k=0; k<input[3].Length; k++)
                        {
                            int pos = a + k;
                            str_cs[pos] = cs2[k];
                        } 

                        str = new String(str_cs);

                        break;
                        
                }
            }
        }
    }
}