Bits Equalizer

You are given two strings $S$ and $T$ of the same length. $S$ consists of the characters 0, 1 and ?, and $T$ consists of 0 and 1 only. Convert $S$ into $T$ using as few moves as possible. One move is one of the following:

1. change a 0 in $S$ to 1
2. change a ? in $S$ to 0 or 1
3. swap two characters of $S$

No move turns a 1 back into a 0.

For example, take $S =$ 01??00 and $T =$ 001010. Three moves are enough:

• at the start $S =$ 01??00
• move 1 changes the third character to 1, so $S =$ 011?00
• move 2 changes the fourth character to 0, so $S =$ 011000
• move 3 swaps the second character with the fifth character, so $S =$ 001010

The first line holds the number of test cases $C$. ($1 \le C \le 200$)

Each test case is two lines. The first line holds the string $S$ made of 0, 1 and ?. The second line holds the string $T$ made of 0 and 1. The two strings have the same length, which is between 1 and 100.

For each test case, print one line in the format Case x: y, where $x$ is the test case number starting at 1 and $y$ is the minimum number of moves that turns $S$ into $T$. If no sequence of moves turns $S$ into $T$, print -1 in place of $y$.