Turn S into T

You are given two strings $S$ and $T$ of the same length. $S$ is made of the characters 0, 1, and ?, while $T$ is made of 0 and 1. Find the minimum number of operations needed to turn $S$ into $T$.

The allowed operations are:

1. change a 0 in $S$ into a 1;
2. change a ? in $S$ into a 0 or a 1;
3. swap the characters at two positions of $S$.

For example, if $S$ is 01??00 and $T$ is 001010, three operations are enough:

• start from 01??00;
• change the 3rd character (a ?) to 1, giving 011?00;
• change the 4th character (a ?) to 0, giving 011000;
• swap the 2nd and 5th characters, giving 001010.

The first line contains the number of test cases $C$ ($C \le 200$). Each test case consists of two lines: the first is $S$ (made of 0, 1, ?) and the second is $T$ (made of 0, 1). The two strings have equal length, which does not exceed $100$, and neither is empty.

For each test case, output a line Case x: r, where x is the test case number (starting from 1) and r is the minimum number of operations needed to turn $S$ into $T$. If it is impossible to turn $S$ into $T$, output -1 as r.