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 extends App {

  override def main(args: Array[String]): Unit = {
    val input = io.StdIn.readLine
    val tree = Tree.of(input)

    val q = io.StdIn.readLine.toInt

    (1 to q).map(_ => io.StdIn.readLine.split(' ')).foldLeft(tree)((z, list) => {
//      z.print(0, input.length() - 1)
      list(0) match {
        case "print"   => z.print(list(1).toInt, list(2).toInt)
        case "replace" => z.replace(list(1).toInt, list(2).toInt, list(3))
        case "reverse" => z.reverse(list(1).toInt, list(2).toInt)
      }
    })

  }

  class Tree(val inner: Array[Char]) {
    def print(n: Int, m: Int): Tree = {
      val str = (n to m).foldLeft("")((z, k) => z + inner(k));
      println(str)
      this
    }
    def replace(n: Int, m: Int, str: String): Tree = {
      new Tree((0 until inner.length).map(i => i match {
        case j if (n to m).contains(j) => str.charAt(j - n)
        case j                         => inner(j)
      }).toArray)
    }
    def reverse(n: Int, m: Int): Tree = {
      new Tree((0 until inner.length).map(i => i match {
        case j if (n to m).contains(j) => inner(n + m - j)
        case j                         => inner(j)
      }).toArray)
    }
  }
  object Tree {
    def of(input: String): Tree = {
      new Tree(input.toCharArray())
    }
  }
}