Migrated from Lutece 1317 Keywords Again

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Do you like the Problem K in Preliminary Contest? Now, this is another Keywords Problem.

Given a generated way:

Start with an empty string $S$. Then, choose some position in the string (maybe the very beginning or the very end) and insert $P$. We will get a new $S$ and try to insert it again and again.

For example, $P$ is abc and $S$ is empty, after a single step, $S$ becomes abc. Now Insert $P$ into $S$ again, $S$ may become aabcbc.

Now show you a string $Q$, can you tell me if there exists a string $T$ generated as we mentioned above, and $Q$ is the substring of $T$.

Input

The first line contains a non-empty string $P$.

The second line contains a non-empty string $Q$.

Both $P$ and $Q$ will only contains a to z

$1\leq |Q|\leq |P|\leq 10^5$

Output

If there exists a string $T$ generated as we mentioned above, and $Q$ is the substring of $T$, output POSSIBLE, otherwise output IMPOSSIBLE.

Samples

abcde
bcaab

POSSIBLE

abcde
eabde

IMPOSSIBLE

Resources

The 14th UESTC Programming Contest Final