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 Scala (judge verdict: Accepted)

object Main {
  def main(args: Array[String]): Unit = {
    val scanner = new java.util.Scanner(System.in)

    var str = scanner.next
    val q = scanner.nextInt
    for(_ <- 1 to q) {
      scanner.next match {
        case "print" => println(str.substring(scanner.nextInt, scanner.nextInt + 1))
        case "reverse" => str = reverse(str, scanner.nextInt, scanner.nextInt)
        case _ => str = replace(str, scanner.nextInt, scanner.nextInt, scanner.next)
      }
    }
  }

  def reverse(str: String, a: Int, b: Int): String =
    str.substring(0, a) + str.substring(a, b + 1).reverse + str.substring(b + 1, str.length)

  def replace(str: String, a: Int, b: Int, p: String): String =
    str.substring(0, a) + p + str.substring(b + 1, str.length)
}