Alphabet Distance

You are given two words of equal length. Pair up the letters at each position of the two words, and write a program that computes the alphabet distance for every position.

The alphabet distance between two letters $x$ and $y$ is defined as follows. First, number the letters: $A=1$, $B=2$, $\ldots$, $Z=26$. Then

• if $y \ge x$, the distance is $y - x$;
• if $y < x$, the distance is $(y + 26) - x$.

For example, the distance between $B$ and $D$ is $4 - 2 = 2$, and the distance between $D$ and $B$ is $(2 + 26) - 4 = 24$.

The first line contains the number of test cases $T$ ($T < 100$). Each of the following lines contains one test case: two words separated by a space. Each word consists only of uppercase letters and has length between $4$ and $20$ inclusive, and the two words on the same line have the same length.

For each test case, print one line. First print Distances: , then print the alphabet distance for each position, separated by single spaces.