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)

def find_atob(str, a, b)
  str_atob = str[a..b]
  return str_atob
end

def reverse_atob(str, str_atob)
  str.gsub!(str_atob, str_atob.reverse)
  return str
end

def replace_atob(str, str_atob, p)
  str.gsub!(str_atob, p)
  return str
end

def execute_orders(str, q, order_array)
  for i in 0..(q-1)
    str_atob = find_atob(str, order_array[i][1].to_i, order_array[i][2].to_i)
    if order_array[i][0] == "replace"
      replace_atob(str, str_atob, order_array[i][3])
    elsif order_array[i][0] == "reverse"
      reverse_atob(str, str_atob)
    else
      puts str_atob
    end
  end
end

str = gets.chomp
q = gets.chomp.to_i
order_array = []
for i in 0..(q-1)
  order = gets.chomp.split
  order_array.push(order)
end

execute_orders(str, q, order_array)