A701.[USACO 2015 February Bronze]Censoring

Farmer John has purchased a subscription to Good Hooveskeeping magazine for his cows, so they have plenty of material to read while waiting around in the barn during milking sessions. Unfortunately, the latest issue contains a rather inappropriate article on how to cook the perfect steak, which FJ would rather his cows not see (clearly, the magazine is in need of better editorial oversight).

FJ has taken all of the text from the magazine to create the string S of length at most 10^6 characters. From this, he would like to remove occurrences of a substring T of length <= 100 characters to censor the inappropriate content. To do this, Farmer John finds the first occurrence of T in S and deletes it. He then repeats the process again, deleting the first occurrence of T again, continuing until there are no more occurrences of T in S. Note that the deletion of one occurrence might create a new occurrence of T that didn't exist before.

Please help FJ determine the final contents of S after censoring is complete.

INPUT FORMAT:
The first line will contain S. The second line will contain T. The length of T will be at most that of S, and all characters of S and T will be lower-case alphabet characters (in the range a..z).

OUTPUT FORMAT:
The string S after all deletions are complete. It is guaranteed that S will not become empty during the deletion process.

农民约翰为他的奶牛订阅了《好马蹄》杂志，因此在挤奶期间，他们在谷仓里等待的时候有大量的材料可以阅读。不幸的是，最新一期杂志刊登了一篇关于如何烹饪牛排的文章，这篇文章是 $FJ$ 不想让他的牛看到的。

$FJ$从杂志中提取了所有的文本，创建了长度最多为$10^6$个字符的字符串$S$。因此，他希望删除长度$< = 100$个字符的子字符串 $T$。为此，$Farmer John$ 在 $S$ 中找到 $T$ 的 第一个 匹配项并删除它。然后，他再次重复这个过程，再次删除 $T$ 的第一次出现，一直到 $S$ 中不再出现 $T$。注意，删除一次可能会产生一个以前不存在的 $T$ 。

删除完成后，请帮助 $FJ$ 确定 $S$ 的最终内容。

第一行将包含 $S$。

第二行将包含 $T$。$T$ 的长度最多是 $S$ 的长度，而且 $S$ 和 $T$ 的所有字符都是小写字母字符$($在 $a-z).$

删除完成后的字符串 $S$。保证 $S$ 在删除过程中不会变为空。