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
import collections
from bisect import bisect_right
d=collections.defaultdict(list)
s=input()
t=input()
for i,S in enumerate(s,1):
    d[S].append(i)
k=0
ans=0
for i in t:
    l=d[i]
    if len(l)==0:
        print(-1)
        quit()
    if l[-1]<=ans:
        ans=l[0]
        k+=1
    else:
        ans=l[bisect_right(l,ans)]
print(len(s)*k+ans)