bzoj#P3942. [USACO 2015 Feb] Censoring (Silver)

[USACO 2015 Feb] Censoring (Silver)

Description

Farmer John has purchased a subscription to Good Hooves keeping 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 SS. From this, he would like to remove occurrences of a substring TT to censor the inappropriate content. To do this, Farmer John finds the first occurrence of TT in SS and deletes it. He then repeats the process again, deleting the first occurrence of TT again, continuing until there are no more occurrences of TT in SS.

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 SS after censoring is complete.

Input Format

The first line will contain SS.

The second line will contain TT.

Output Format

The string S after all deletions are complete.

whatthemomooofun
moo
whatthefun

Limit and Hint

For 100%100\% of testcases, 1TS1061\le |T|\le |S|\le 10^6, and all characters of SS and TT will be lower-case alphabet characters. It is guaranteed that SS will not become empty during the deletion process.

## 输入格式
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).

Source

USACO February 2015 Contest Silver T1