A8551. BHTML+BCSS

The first line of the input contains a BHTML-document. The document has length from $4$ to $10^{6}$ characters. The document has a correct structure, doesn't contain spaces or any other unnecessary characters. Tagnames consist of lowercase Latin letters, their lengths are from 1 to 10 characters.

The second line contains an integer $m$ ( $1<=m<=200$ ) — the number of queries. Then $m$ lines contain the queries, one per line. Each query is a sequence $x_{1},x_{2},...,x_{n}$ , where $x_{i}$ is the $i$ -th element of the query, and $n$ ( $1<=n<=200$ ) is the number of elements in the query. The elements are separated by single spaces. Each query doesn't begin with and doesn't end with a space. Each query element is a sequence of lowercase Latin letters with length from 1 to 10.

Print $m$ lines, the $j$ -th line should contain the number of elements of the document that correspond to the $j$ -th BCSS-rule. If there are no such elements at all, print on the line 0.

无