Censorship

Eingabe

The first line contains integers $n$ (1 \leq n \leq 100) — the number of symbols in the alphabet, $m$ (1 \leq m \leq 100) — the length of the strings to generate, and $p$ (0 \leq p \leq 10) — the number of forbidden substrings. The next line contains $n$ symbols with codes greater than $32$ — the alphabet symbols. The following $p$ lines each contain a forbidden string, of length at most $\min (m,10)$, consisting only of alphabet symbols.

Ausgabe

Output the answer on the first line.

Beispiele