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 Ruby (judge verdict: Wrong Answer)

#lines = <<'EOS'
#abcde
#3
#replace 1 3 xyz
#reverse 0 2
#print 1 4
#EOS

lines = $stdin.read

array = lines.split("\n")

str = array[0]
n   = array[1]

for i in 2..(1+n.to_i)
  command = array[i].split(" ")[0]
  a = array[i].split(" ")[1].to_i
  b = array[i].split(" ")[2].to_i

  if command == "replace"
    str[a..b] = array[i].split(" ")[3]
  elsif command == "reverse"
    r = str[a..b].reverse
    len = str.length
    if a == 0
      str = "#{r}#{str[b+1..len]}"
    elsif b == 0
      str = "#{str[0..a-1]}#{r}"
    else
      str = "#{0..a-1}#{r}#{b+1..len}"
    end
  elsif command == "print"
    puts str[a..b]
  end
end