Statement

Maintain a lowercase text string under commands INS p s, DEL l r, REV l r, CUT l r p, and Q l1 r1 l2 r2.

Insertion is after the first $p$ characters. A cut first removes the substring $[l,r]$, then inserts it after the first $p$ characters of the remaining string. A query asks whether the two current closed-interval substrings are exactly equal. All parameters are valid. The initial length plus the total length of inserted strings is at most $200000$.

Input

The first line is a nonempty initial string. The second line contains $q$ ($1 \le q \le 200000$). The next $q$ lines contain commands; every inserted string is nonempty, and the current length never exceeds $200000$.

Output

For every query, print YES if the two substrings are equal and NO otherwise.

Samples

Sample 1

Input:

abcde
8
Q 1 3 3 5
REV 2 4
INS 2 zz
Q 3 4 3 4
CUT 3 4 1
Q 1 2 6 7
DEL 2 3
Q 1 2 4 5

Output:

NO
YES
NO
NO