Problem Description

Barbara is a speed typer. In order to check her typing speed, she performs a speed test. She is given a string $I$ that she is supposed to type.

While Barbara is typing, she may make some mistakes, such as pressing the wrong key. As her typing speed is important to her, she does not want to spend additional time correcting the mistakes, so she continues to type with the errors until she finishes the speed test. After she finishes the speed test, she produces a $P$.

Now she wonders how many extra letters she needs to delete in order to get $I$ from $P$. It is possible that Barbara made a mistake and $P$ cannot be converted back to $I$ just by deleting some letters. In particular, it is possible that Barbara missed some letters.

Help Barbara find out how many extra letters she needs to remove in order to obtain $I$ or if $I$ cannot be obtained from $P$ by removing letters then output IMPOSSIBLE.

Input Format

The first line of the input gives the number of test cases, $T$. $T$ test cases follow.

Each test case has $2$ lines. The first line of each test case is an input string $I$ (that denotes the string that the typing test has provided). The next line is the produced string $P$ (that Barbara has entered).

Output Format

For each test case, output one line containing Case $\#x$: $y$, where $x$ is the test case number (starting from $1$) and $y$ is the number of extra letters that need to be removed in order to obtain $I$. If it is not possible to obtain $I$ then output IMPOSSIBLE as $y$.

2
aaaa
aaaaa
bbbbb
bbbbc

Case #1: 1
Case #2: IMPOSSIBLE

2
Ilovecoding
IIllovecoding
KickstartIsFun
kkickstartiisfun

Case #1: 2
Case #2: IMPOSSIBLE

Hint

In the first test case, $P$ contains one extra $a$, so she needs to remove $1$ extra letter in order to obtain $I$.

In the second test case, Barbara typed only $4$ letters $b$, while $I$ consists of $5$ letters $b$ so the answer is IMPOSSIBLE.

Limits

$1 \le T \le 100$.

Both the strings contain letters from $a$-$z$ and $A$-$Z$.

Length of the given strings will be $1 \le |I|, |P| \le 10^5$.

Test Set 1

All letters in $I$ are the same.

Test Set 2

No additional constraints.