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)

import scala.io.StdIn.{readLine, readInt}

object Main extends App {
  var str = readLine()
  val m = readInt()
  for (_ <- 1 to m) {
    val line = readLine().split(" ")
    val cmd = line(0)
    val start = line(1).toInt
    val end = line(2).toInt + 1
    val Array(p1, p2, p3) = splitStr(str, start, end)
    cmd match {
      case "replace" => str = s"$p1${line(3)}$p3"
      case "reverse" => str = s"$p1${p2.reverse}$p3"
      case "print" => println(p2)
    }
  }

  def splitStr(str: String, start: Int, end: Int): Array[String] = {
    val arr = Array[String]("", "", str.substring(end))
    if (start == 0) {
      arr(1) = str.substring(0, end)
    } else {
      arr(0) = str.substring(0, start)
      arr(1) = str.substring(start, end)
    }
    arr
  }
}