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 *
s = input()
t = input()
pos = {}
for j,i in enumerate(s):
  if i in pos.keys():
  	pos[i].append(j+1)
  else:
    pos[i] = [j+1]
n = len(s)
for i in pos.keys():
  pos[i].append(pos[i][0] + n)
ans = 0
last = 0
for i in t:
  if not i in s:
    print(-1)
    exit()
  last = pos[i][bisect(pos[i],last)]
  if last > n:
    last -= n
    ans += n
print(ans + last)
