I'm currently stuck on Sortware Bugs — CTU Open 2012.

**Problem Summary:**

You're given a string *S* and a string *B* (*S* has at most 10^{7} characters, and *B* has at most 1000 characters); and you need to remove *B* from *S* repeatedly until there is no *B* in *S*.

Can you give me some hints? I have been trying to solve this problem for two days, and I cannot figure out any way to solve this problem.

There is a solution on the Internet; however, since it is not in English (and Google Translate didn't help much), I cannot understand it :(.

Thank you :)