Badge Queue Realignment Cost

At a conference, every attendee wears a badge printed with a single unique lowercase letter -- no two attendees share a letter. The string s records the original left-to-right queue order, and the string t records how the same attendees re-formed their queue after a break; both strings use exactly the same set of letters, each appearing exactly once. For every attendee, compute the absolute difference between their 0-indexed position in s and their 0-indexed position in t, then sum these differences across all attendees to obtain the total realignment cost.

Input format

• Line 1: the string s.
• Line 2: the string t.

Output format

A single integer: the total realignment cost.

Constraints

• 1 ≤ |s| = |t| ≤ 26
• s and t consist of lowercase English letters only.
• Every character of s is distinct, and t is a permutation of s (the same multiset of letters, each appearing exactly once in both).

abc
cab

4

a
a

0