A quality-control scanner arm slides along a single straight rail mounted above a conveyor line. The rail holds exactly 26 fixed slots, numbered 0 through 25 from left to right, and a distinct lowercase-letter label has been bolted into each slot according to a known layout. At the start of the shift the arm is parked directly above slot 0. To read a manifest, the arm must visit the slot holding each label of the manifest in order, one label at a time, sliding along the rail between consecutive visits (including the very first slide, from its starting position at slot 0 to the slot of the first label). Sliding between two slots costs time equal to the absolute difference of their slot numbers. Given the rail's layout and a manifest, find the total time the arm spends sliding to read the entire manifest from start to finish.

Input format

• Line 1: a string layout of exactly 26 lowercase English letters, a permutation of a through z, where layout[i] is the label bolted into slot i (0-indexed).
• Line 2: a string manifest of lowercase English letters — the labels to visit, in order.

Output format

A single integer: the total sliding time to visit every label of manifest in order, starting from slot 0.

Constraints

• layout has length exactly 26 and is a permutation of a-z.
• 1 <= length of manifest <= 1000
• manifest consists only of lowercase English letters (each one necessarily appears somewhere in layout, since layout is a permutation of the full alphabet).

abcdefghijklmnopqrstuvwxyz
cba

4

pqrstuvwxyzabcdefghijklmno
cargo

47