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 bisect import bisect_left

s = input()
n = len(s)
s = s + s
t = input()
m = len(t)

ls = [[] for _ in range(26)]

for i in range(2*n):
    ls[ord(s[i])-97].append(i)

res = 0
flg = True
ind = -1
for i in range(m):
    if ls[ord(t[i])-97] == []:
        flg = False
        break
    nind = ls[ord(t[i])-97][bisect_left(ls[ord(t[i])-97],ind+1)]
    res += nind - ind 
    if nind >= n:
        nind -= n
    ind = nind
if flg:print(res)
else:print(-1)