Transform the string

def solve(S , F):
    steps = 0
    for letter in S:
        if abs(ord(letter) - ord(F)) > 13:
            steps += abs(abs(ord(letter) - ord(F)) - 26)
        else:
            steps += abs(ord(letter) - ord(F))
    return steps

cases = int(input())
for i in range(cases):
    S, F = input(),  input()
    print('Case #{}: {}'.format( i+1, solve(S, F)))