Problem J: String - Transformation

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $116$ 正确数量 $61$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL 字符串

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.

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.
For each print command, print a string in a line.
abcde
3
replace 1 3 xyz
reverse 0 2
print 1 4
xaze

1≤ length of str≤1000

1≤q≤100 

0≤a≤b< length of str 

for replace command, b−a+1= length of p