Mysterious Device

Dima has a device with $n + m$ buttons and a screen. The screen shows a string $s$, which is initially empty.

Pressing button $i$ ($1 \le i \le n$) appends the string $w_i$ to the end of $s$. Pressing button $n + i$ ($1 \le i \le m$) removes $a_i$ characters from the end of $s$. If $s$ has fewer than $a_i$ characters, it becomes empty.

Dima has $q$ favorite strings $t_i$. For each one, determine whether he can make $s$ equal to $t_i$ by pressing buttons some number of times, starting from the empty string $s$.

The first line contains two integers $n$ and $m$ ($1 \le n, m \le 100000$), the number of buttons of the first and second type.

The next $n$ lines contain non-empty strings $w_i$ consisting of lowercase English letters. The total length of all strings $w_i$ does not exceed $10^6$.

The next $m$ lines contain integers $a_i$ ($1 \le a_i \le 10^6$).

The next line contains an integer $q$ ($1 \le q \le 100000$), the number of Dima's favorite strings.

The next $q$ lines contain non-empty strings $t_i$ consisting of lowercase English letters. The total length of all strings $t_i$ does not exceed $10^6$.

For each string $t_i$, print Yes on its own line if $s$ can be made equal to $t_i$, and No otherwise.