An old telephone switchboard has 26 slots arranged in a single row, numbered 0 to 25 from left to right. A layout string assigns each of the 26 lowercase letters to exactly one slot: the letter at position i of the layout string occupies slot i. An operator wants to key in a lowercase word by moving one finger across the slots, pressing the slot for each letter of the word in order. The finger starts resting at slot 0 before the first letter is pressed. Moving the finger from a slot at position p to a slot at position q costs |p - q| units of time, and the finger must visit slots in the exact order needed to spell the word (one slot press per character, including repeats).

Given the layout and the word, compute the total time needed to key in the entire word.

Input format

Line 1: the layout string — exactly 26 lowercase letters, a permutation of a-z. Line 2: the word — a non-empty string of lowercase letters.

Output format

A single integer: the total time to key in the word.

Constraints

• The layout is always a permutation of the 26 lowercase letters (each letter appears exactly once).
• 1 <= length of word <= 100
• The word contains only lowercase English letters.

abcdefghijklmnopqrstuvwxyz
cba

4

bacdefghijklmnopqrstuvwxyz
aabb

2