Given are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.

* Let s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\ldots{s'}_i (the first i characters in s').

Constraints

* 1 \leq |s| \leq 10^5
* 1 \leq |t| \leq 10^5
* s and t consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


s
t


Output

If there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print `-1`.

Examples

Input

contest
son


Output

10


Input

contest
programming


Output

-1


Input

contest
sentence


Output

33
from collections import defaultdict
from bisect import bisect_right
s = input()
t = input()
n = len(s)
m = len(t)

# 存在確認
aa = set(s)
for i in t:
    if i not in aa:
        print(-1)
        exit()

d = defaultdict(list)

for i in range(n):
    d[s[i]].append(i)

pos = -1
cnt = 0
for c in t:
    j = bisect_right(d[c], pos)
    if j < len(d[c]):
        pos = d[c][j]
    else:
        cnt += 1
        pos = d[c][0]
print(cnt*n + pos+1)