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)

#!/usr/bin/ruby
# -*- coding: utf-8 -*-
=begin
ITP1_9-D

String - Transformation
Time Limit : 1 sec, Memory Limit : 65536 KB
???????????????

????????? str

?????????????????????????????????????????????????????????????????°???????????????????????????????????????????????\?????????????????????????????§??????

    print a b: str

??? a ??????????????? b ??????????????§??????????????????
reverse a b: str
??? a ??????????????? b ??????????????§?????????????????????
replace a b p: str

    ??? a ??????????????? b ??????????????§??? p ?????????????????????

????????§??????????????? str

????????????????????? 0 ???????????¨????????????
Input

1 ?????????????????? str
????????????????????????str ?????±?°????????????????????????????2 ????????????????????° q ?????????????????????????¶???? q

??????????????????????¨??????¢?????§?????????????????????
Output

??? print ???????????¨???????????????????????????????????????????????????
Constraints

    1???str????????????1000

1???q???100
0???a???b<str?????????
replace ????????§??? b???a+1=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

=end

class Str_manipulate
  def initialize(s)
    @str = s
    #puts "str=" + @str
  end

  def print(a,b)
    puts @str.slice(a..b)
    #puts "str=" + @str
    @str
  end

  def reverse(a,b)
    len = @str.length
    if a-1>=0 then
      zen = @str.slice(0..(a-1))
    else
      zen = ""
    end
    naka= @str.slice(a..b).reverse
    if b+1 <= len-1 then
      kou = @str.slice((b+1)..(len-1))
    else
      kou=""
    end
    @str =  zen + naka + kou
    #puts "str=" + @str
    @str
  end

  def replace(a,b,p)
    @str[a..b] = p
    #puts "str=" + @str
    @str
  end
end

class Main
  def initialize()
    #fh = open("IPT1_9_D.txt")
    fh = STDIN
    s = fh.gets.chomp
    sm = Str_manipulate.new(s)
    n = fh.gets.chomp.to_i
    (1..n).each {|x|
      fl = fh.gets.chomp.split
      if fl[0] == "print" then
        sm.print(fl[1].to_i,fl[2].to_i)
      elsif fl[0] == "reverse" then
        sm.reverse(fl[1].to_i,fl[2].to_i)
      elsif fl[0] == "replace" then
        sm.replace(fl[1].to_i,fl[2].to_i,fl[3])
      end
    }
  end
end

if $0 == __FILE__ then
  Main.new
end