Problem Statement

You are given a string $S$ of length $N$ consisting of lowercase English letters.

A total of $Q$ queries of the following $2$ types will be given. Process them in order.

• 1 i c Update the $i$-th character of $S$ to $c$.
• 2 t Answer whether $S$ contains $t$ as a subsequence.

Here, when a string $s'$ obtained by deleting $0$ or more characters from a string $s$ matches $t$, we define that $s$ contains $t$ as a subsequence.

Constraints

• $1\leq N,Q\leq 2\times 10^5$
• $S$ is a string of length $N$ consisting of lowercase English letters
• In queries of type $1$, $1\leq i\leq N$
• In queries of type $1$, $c$ is a lowercase English letter
• In queries of type $2$, $t$ is a string of lowercase English letters with length at least $1$ and at most $10$
• Queries of type $2$ are given at least $1$ time
• All numbers given in the input are integers

Subtasks

This problem has partial scoring by subtasks.

Input

$N\ Q$
$S$
$Query_1$
$Query_2$
$\vdots$
$Query_Q$

Also, $Query$ is given as follows:

$1\ i\ c$

$2\ t$

It is given in one of the above forms.

Output

When query 2 is given $t$ times, print $t$ lines.

On the $i\ (1\leq i\leq t)$-th line, answer the $i$-th given query 2. Print Yes if it is contained, and No if it is not.

Sample

5 5
abcde
2 ac
2 bf
1 3 f
2 ac
2 bf

Yes
No
No
Yes

7 7
aitsuki
2 aitsuki
2 itsuki
2 azki
1 4 z
2 aitsuki
2 itsuki
2 azki

Yes
Yes
No
No
No
Yes