Portal Gun

Rick knows perfectly well that Morti cannot be trusted with a portal gun, but Morti has pestered him for his own portal gun for so long that Rick gave in and built him a mini version.

To make Morti improve (or simply to make it harder for him to use), Rick made the device quite convoluted. The portal gun has $n$ parameters, each taking a value from 'a' to 'z'. Let $p_i$ denote the parameter with number $i$.

In one action, Morti can:

• choose a parameter index $i$ from $1$ to $n$ and change its value to another value $c$ from 'a' to 'z';
• choose two values $c_1$ and $c_2$ from 'a' to 'z' and replace the value of all parameters whose current value is $c_1$ with $c_2$;
• check whether portals can be created at locations $(l_1, r_1)$ and $(l_2, r_2)$ (where $l_1 \leqslant r_1$ and $l_2 \leqslant r_2$). For this, the parameters at positions $[l_1, r_1]$ must match elementwise the parameters at positions $[l_2, r_2]$, that is, the following must hold:

$\begin{cases} r_1 - l_1 = r_2 - l_2 \\ p_{l_1 + i} = p_{l_2 + i} & \text{for all } 0 \leqslant i \leqslant r_1 - l_1 \end{cases}$

Morti is not very clever, so comparing parameter sequences quickly is hard for him, and he does not want to break the portal gun by accident. For each action of the third type, determine whether he can create the portals at the requested locations.

The first line contains a string $p$ of length $n$ consisting of lowercase Latin letters, the initial values of the parameters ($1 \leqslant n \leqslant 2 \cdot 10^5$).

The next line contains a single integer $q$, the number of actions Morti performs ($1 \leqslant q \leqslant 2 \cdot 10^5$).

Each of the next $q$ lines describes an action:

• 1 $i$ $c$: set the $i$-th parameter to value $c$ ($1 \leqslant i \leqslant n$; 'a' $\leqslant c \leqslant$ 'z').
• 2 $c_1$ $c_2$: replace every value equal to $c_1$ among all parameters with $c_2$ ('a' $\leqslant c_1, c_2 \leqslant$ 'z').
• 3 $l_1$ $r_1$ $l_2$ $r_2$: check whether portals can be created at locations $(l_1, r_1)$ and $(l_2, r_2)$ ($1 \leqslant l_1, r_1, l_2, r_2 \leqslant n$; $l_1 \leqslant r_1$; $l_2 \leqslant r_2$).

For each action of the third type, print YES on a separate line if Morti can perform it, and NO otherwise.