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 ITP1
{
    class Program
    {
        static void Main(string[] args)
        {
            string str = Console.ReadLine();
            char[] s = str.ToCharArray();
            int q = int.Parse(Console.ReadLine());

            for (int i = 0; i < q; i++)
            {
                string[] input = Console.ReadLine().Split(' ');
                int a = int.Parse(input[1]);
                int b = int.Parse(input[2]);
                switch (input[0])
                {
                    case "print":
                        for (int k = a; k <= b; k++)
                        {
                            Console.Write(s[k]);
                        }
                        Console.WriteLine();
                      
                        break;
                    case "reverse":
                        char[] z = new char[b-a+1];
                        int e = 0;
                        for (int k = a; k <= b ; k++)
                        {
                            z[e] = s[k];
                            e++;
                        }
                        e--;
                        for (int k = a; k <= b; k++)
                        {
                            s[k] = z[e];
                            e--;
                        }
                       
                        break;
                    case "replace":
                        string p = input[3];
                        int c = 0;
                        for (int k = a; k <= b ; k++)
                        {
                            s[k] = p[c];
                            c++;
                        }
                        
                            break;
                }

            }
        }
    }
}