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.

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$

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.

Examples

Input

abcde
3
replace 1 3 xyz
reverse 0 2
print 1 4


Output

xaze


Input

xyz
3
print 0 2
replace 0 2 abc
print 0 2


Output

xyz
abc
import java.util.*;

public class Main {
  public static void print(String s, int a, int b) {
    System.out.println(s.substring(a, b + 1));
  }
  public static String reverse(String s, int a, int b) {
    String[] arr = s.split("");
    StringBuilder sb = new StringBuilder();
    for(int i = 0; i < a; i++) {
      sb.append(arr[i]);
    }
    for(int i = b; i > a - 1; i--) {
      sb.append(arr[i]);
    }
    for(int i = b + 1; i < s.length(); i++) {
      sb.append(arr[i]);
    }
    return sb.toString();
  }
  public static String replace(String s, String p, int a, int b) {
    String q = s.substring(0, a);
    String r = s.substring(b + 1);
    return q + p + r;
  }
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String str = sc.next();
    int q = sc.nextInt();
    for(int i = 0; i < q; i++) {
      String order = sc.next();
      int a = sc.nextInt();
      int b = sc.nextInt();
      if(order.equals("print")) {
        print(str, a, b);
      } else if(order.equals("reverse")) {
        str = reverse(str, a, b);
      } else {
        String p = sc.next();
        str = replace(str, p, a, b);
      }
    }
  }
}

