You are given a string S and Q query strings (q₁, q₂, ... , q_Q). For each query string, report whether or not it is a subsequence of S.

Input :

The first line contains a string S.

The next line contains a single integer, Q.

The following Q lines each contain 1 query string q_i.

Output :

Output Q lines. On the i^th line print "Yes" (without quotes) if q_i is a sub-sequence of S, otherwise print "No" (without quotes).

Constraints :

1 <= |S|, |q[i]|, Q <= 100,000

Sum of lengths of all query strings <= 1,000,000

All strings consist of lowercase english letters only. ('a'-'z')