Dictionary of Obscene Words

You are given a dictionary of obscene words $S_1, S_2, \ldots, S_n$ and a text $T$. Determine whether $T$ contains at least one of the dictionary words as a subsequence. If it does, find the length of the shortest prefix of $T$ that already contains such a subsequence.

The first line contains a single integer $n$, the number of words in the dictionary. Each of the next $n$ lines contains one dictionary word. Every word consists of ASCII characters whose codes lie between $32$ and $127$, inclusive (so a word may contain spaces). The following line contains the text $T$, made up of the same set of characters. The total length of all dictionary words does not exceed $100$ KiB ($100 \times 2^{10}$ bytes). The total size of the input does not exceed $1$ MiB ($2^{20}$ bytes).

Print NO if the text contains no obscene word as a subsequence. Otherwise print YES X, where $X$ is the length of the shortest prefix of $T$ that contains some obscene word as a subsequence.