Hacker

A hacker has broken into Miltos's e-mail account again. Miltos decides to replace his password with a much stronger one. The old password $W$ is a string of $N$ lowercase Latin letters, and the new password starts as an exact copy of $W$. Miltos applies $Q$ operations to the new password in order, and he asks you to simulate them.

There are three kinds of operations.

• 1 i j k: compare the substring of the new password from position $i$ to position $j$ with the substring of the new password that starts at position $k$ and has length $j - i + 1$. Print Y if the two substrings are equal, otherwise print N.
• 2 i j k: replace positions $i$ to $j$ of the new password with the substring of the old password $W$ that starts at position $k$ and has length $j - i + 1$.
• 3 i j: advance every letter of the new password from position $i$ to position $j$ to the next letter, cyclically. The letter a becomes b, b becomes c, and z becomes a.

Positions are counted from 1. Every operation is valid, so $1 \le i \le j \le N$, and operations of kind 1 and kind 2 satisfy $k + j - i \le N$. The old password $W$ never changes, and the length of the new password is always $N$.

The first line contains the old password $W$. The second line contains the number of operations $Q$. Each of the next $Q$ lines contains one operation in one of the formats above.

For every operation of kind 1, print Y or N on its own line, in the order the operations are given.