Young theoretical computer scientist wyh2000 is teaching young pupils some basic concepts about strings.
A subsequence of a string $s$ is a string that can be derived from $s$ by deleting some characters without changing the order of the remaining characters. You can delete all the characters or none, or only some of the characters.
He also teaches the pupils how to determine if a string is a subsequence of another string. For example, when you are asked to judge whether $\texttt{wyh}$ is a subsequence of some string or not, you just need to find a character $\texttt{w}$, a $\texttt{y}$, and an $\texttt{h}$, so that the $\texttt{w}$ is in front of the $\texttt{y}$, and the $\texttt{y}$ is in front of the $\texttt{h}$.
One day a pupil holding a string asks him, "Is $\texttt{wyh}$ a subsequence of this string?"
However, wyh2000 has severe myopia. If there are two or more consecutive character $\texttt{v}$s, then he would see it as one $\texttt{w}$. For example, the string $\texttt{vvv}$ will be seen as $\texttt{w}$, the string $\texttt{vvwvvv}$ will be seen as $\texttt{www}$, and the string $\texttt{vwvv}$ will be seen as $\texttt{vww}$.
How would wyh2000 answer this question?
Input
The first line of the input contains an integer $T(T\le 10^5)$, denoting the number of testcases.
$N$ lines follow, each line contains a string.
Total string length will not exceed 3145728. Strings contain only lowercase letters.
The length of hack input must be no more than 100000.
Output
For each string, you should output one line containing one word. Output $\texttt{Yes}$ if wyh2000 would consider $\texttt{wyh}$ as a subsequence of it, or $\texttt{No}$ otherwise.
