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;

class Program
{    

    static void Main(string[] args)
    {
        string str = Console.ReadLine();    
        char[] origin = str.ToArray();      
        string input;
        int n = int.Parse(Console.ReadLine());    
        string[] strer;
        int a;
        int b;
        string p;
        var resultlist = new List<string>();  

        for(int i = 0; i < n; i++)
        {
            input = Console.ReadLine();
            strer = input.Split(' ');
                     
            if(strer[0] == "replace")
            {
                
                a = int.Parse(strer[1]);
                b = int.Parse(strer[2]);
                p = strer[3];

                char[] ch = p.ToArray();  

                for(int j = 0; j < b - a + 1; j++)
                {
                    origin[a + j] = ch[j];
                }               
            }
            else if(strer[0] == "print")
            {
                a = int.Parse(strer[1]);
                b = int.Parse(strer[2]);
                char[] c = new char[b - a + 1];
                for(int j = 0; j < b - a + 1; j++)
                {
                    c[j] = origin[a + j];
                }

                string s = new string(c);
                resultlist.Add(s);
               
            }
            else if(strer[0] == "reverse")
            {
                a = int.Parse(strer[1]);
                b = int.Parse(strer[2]);
                
                Array.Reverse(origin, a, b - a + 1);
                
            }

        }

        foreach(var s in resultlist)
        {
            Console.WriteLine(s);
        }





    }
}