You are given a list L of N distinct strings, where each string is denoted by $s_i$.

For two strings a and b, define a function,

                F(a, b) =  1   if a is suffix of b
                          0   otherwise

For a given list of strings X and any string s $\in$ X ,
Define a function,

G(s, X) = $\sum_{ \forall y \in X}$ F(s, y)

Your task is to answer Q queries. In $i^{th}$ query you are given $k_i$ indices, where each index denotes the index of the respective string in the given list L. Let T denote the list of strings given in the query. Then, output the maximum value of G(s, T) $\forall s \in T$.

Input :

First line contains two integers N and Q. The next N lines each contain a single string $s_i$ belonging to list L. This is followed by Q lines, with the $i^{th}$ line denoting the $i^{th}$ query. Each query starts with an integer $k_i$ followed by $k_i$ integers denoting the indices of strings in this query.

Output :

For every query output a single integer denoting the maximum value of G.

Constraints :

$1 \le N, Q \le 10^{5}$

$\sum_{i} |s_i| \le 10^{6}$

$\sum_{i} |k_i| \le 10^{6}$

Note: All string contain only lowercase English alphabet.