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: Accepted)

def replace(str, st, ed, repl)
	str[st..ed] = repl
	return str
end

def reverse(str, st, ed)
	t = str.split(//)
	while st < ed do
	  t[st], t[ed] = t[ed], t[st]
	  st += 1
	  ed -= 1
	end
	return t.join("")
end

def print(str, st, ed)
	puts str[st..ed]
end


base = gets.chomp
  
n = gets.to_i
  
n.times do
  t = gets.split(" ")
  if t[0]=="replace"
    base = replace(base, t[1].to_i, t[2].to_i, t[3])
  elsif t[0]=="reverse"
    base = reverse(base, t[1].to_i, t[2].to_i)
  else
    print(base, t[1].to_i, t[2].to_i)
  end
  
end