Purify

Your task is to tidy up all the clutter (a list of forbidden words $N_i$) scattered around your room (a text string $P$).

Write a program that removes every occurrence of the strings $N_i$ from the string $P$. More precisely, while $P$ contains some $N_i$ as a substring, repeat the following: take the shortest prefix of $P$ that contains some $N_i$, and delete from it the shortest string $N_i$ that this prefix contains.

The first line contains a string $P$ consisting of digits and lowercase and uppercase English letters. The length of $P$ is at most $10^5$. Each of the following lines contains exactly one string $N_i$, also consisting of digits and lowercase and uppercase English letters. The total length of all strings $N_i$ is at most $10^5$.

Print, on a single line, what remains of $P$ after all $N_i$ have been removed. You may assume that the remaining length of $P$ is always at least 1.