Description

Original source: USACO 2015 Feb. Silver

Given two strings $S$ and $T$, repeatedly find a substring $A = T$ in $S$ from front to back, delete it, and fill the gap by shifting the remaining characters forward. Repeat this process until $S$ no longer contains $T$ as a substring. Output the final string $S$.

Input Format

The first line contains a string $S$, and the second line contains a string $T$.

Output Format

Output the processed string $S$.

Sample 1

whatthemomooofun
moo

whatthefun

Constraints & Hints

For all test cases, $1\le |T|\le |S|\le 10^6$, and it is guaranteed that the strings consist only of lowercase letters.