Editing 2015 Feb Bronze Problem 1 Censoring (Bronze) (section)

== Problem ==

In the problem titled 'Censoring (Bronze)' from the USACO 2015 February Contest, the farmer John is trying to write a book but there is a specific word, let's call it T, that he finds displeasing and wants to remove from his text.

John has already written a word S. Every time word T appears in S as a consecutive substring, John deletes it. This process continues until there are no occurrences of T in S.

You are to help John decide what the final version of S will be after all deletions are made.

=== Input ===
The input consists of two lines. The first line contains the initial word S (1 ≤ |S| ≤ 1,000,000), composed of lowercase letters, and the second line contains the displeasing word T (1 ≤ |T| ≤ 100), also composed of lowercase letters.

=== Output ===
The output should be a single line containing the final version of S after all deletions have been made.