Slice String

Ims, who likes strings, made a new string game.

The game uses a delimiter, the criterion for splitting a string, and a merger, a condition that excludes a character from being a delimiter. The rules are as follows.

• This game splits a string by the rules below.
• The string is split by spaces and the given delimiters.
• Each character delimiter is one English letter, uppercase or lowercase.
• Each digit delimiter is one digit from 0 to 9.
• Characters given as mergers are not treated as delimiters.
• Each merger is one English letter or one digit from 0 to 9.
• Delimiters and mergers each consist of one character.
• The target string consists of English letters, digits, and spaces.
• The same delimiter or merger may be given more than once.

Given $N$ character delimiters, $M$ digit delimiters, $K$ mergers, the length $S$ of the target string, and the target string, print the result of applying these rules.

The first line contains the number of character delimiters $N$. $(1 \le N \le 1\,000)$

The second line contains the $N$ character delimiters, separated by spaces.

The third line contains the number of digit delimiters $M$. $(1 \le M \le 1\,000)$

The fourth line contains the $M$ digit delimiters, separated by spaces.

The fifth line contains the number of mergers $K$. $(1 \le K \le 1\,000)$

The sixth line contains the $K$ mergers, separated by spaces.

The seventh line contains the length of the target string $S$. $(1 \le S \le 1\,000)$

The eighth line contains the target string.

Print the result of applying the rules, one result per line.

The result is never an empty string.