Womais has a string $$$s$$$ consisting of lowercase letters and a pattern $$$p$$$ consisting of lowercase letters and stars. We say that the string $$$a$$$ fits the pattern $$$b$$$ if it is possible to get $$$a$$$ by replacing every star in $$$b$$$ with a (possibly empty) string. Different stars can be replaced by different strings. You are given a series of single-character modifications on the string $$$s$$$, and your task is to help Womais determine whether there exists a substring of $$$s$$$ which fits $$$p$$$ after each modification. Here a substring of a string $$$s = s_1s_2\ldots s_{\lvert s \rvert}$$$ is a string $$$s_ls_{l+1}\ldots s_r$$$ for some $$$1 \leq l \leq r \leq \lvert s \rvert$$$.
The first line of the input consists of a string $$$s$$$ ($$$1 \leq \lvert s \rvert \leq 2\cdot 10^5$$$) consisting of lowercase Latin letters. The second line contains a string $$$p$$$ ($$$1 \leq \lvert p \rvert \leq 200$$$) consisting of lowercase Latin letters and characters '*'. It is guaranteed that $$$p$$$ does not contain two consecutive stars. The third line contains a single integer $$$q$$$ ($$$0 \leq q \leq 2\cdot 10^4$$$), indicating the number of modifications to follow. The following $$$q$$$ lines each consist of an integer $$$i$$$ ($$$1 \leq i \leq \lvert s \rvert$$$) and a character $$$\texttt{c} \in \texttt{[a-z]}$$$, indicating that the $$$i$$$-th character of $$$s$$$ is changed to $$$\texttt{c}$$$.
The output should contain $$$q+1$$$ lines. The first line should contain "Yes" (without quotes) if there exists a substring of $$$s$$$ which fits the pattern $$$p$$$, and "No" (without quotes) otherwise. The $$$i$$$-th of the following $$$q$$$ lines should contain the answer to the same question after $$$s$$$ has undergone the first $$$i$$$ modifications.
The output is not case-sensitive, meaning that "Yes", "yes" or "yEs" will all count as an affirmative answer.
abacabada*a*a*a23 c4 a
Yes No Yes
stanford*sta*r63 s5 a4 t1 u8 r7 n
Yes No No Yes Yes Yes Yes
