Farmer John has taken all of the text from a 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 inappropriate content. To do this, FJ finds the first occurrence of T in S and deletes it. He then repeats the process, 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.

Line 1: S. Line 2: T. The length of T will be at most that of S, and all characters of S and T are lower-case alphabet characters (a..z).

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

riseoj 작성

출처 올림피아드 > USACO > 2014-2015 > February > Bronze