Transform the String

You are given a string $S$ that denotes a padlock consisting of lowercase English letters. You are also given a string $F$ consisting of a set of favorite lowercase English letters. You may perform several operations on the padlock. In each operation, you can change one letter of the string to the one following it or preceding it in alphabetical order. For example, for the letter c, you may change it to either b or d in an operation. The letters are considered in cyclic order, so the preceding letter for a is z, and the following letter for z is a.

Find the minimum number of operations required so that every letter in string $S$ after the operations is present in string $F$.

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

Each test case consists of two lines.

The first line of each test case contains the string $S$.

The second line of each test case contains the string $F$.

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 minimum number of operations required so that every letter in string $S$ after the operations is one of the characters in string $F$.

• $1≤T≤100$.
• $1≤$ the length of $S≤10^5$.
• $S$ consists only of lowercase English letters.
• $F$ consists only of distinct lowercase English letters.
• The letters in string $F$ are sorted lexicographically.