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 bisect
s=input()
t=input()

d=dict()
for i in "abcdefghijklmnopqrstuvwxyz":
    d[i]=[]
for i,c in enumerate(s):
    d[c].append(i)

now=0
ans=0
for c in t:
    l=len(d[c])
    if l==0:
        print(-1)
        break
    i=bisect.bisect_left(d[c],now)
    if i<l:
        now=d[c][i]+1
    else:
        ans+=len(s)
        i=bisect.bisect_left(d[c],0)
        now=d[c][i]+1
else:
    ans+=now
    print(ans)