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()
l = len(s)
ch = [[] for _ in range(26)]
s *= 2
for i in range(l*2):
  ch[ord(s[i]) - ord("a")].append(i)
  
t = input()
ans = 0
now = -1
for i in t:
  idx = ord(i) - ord("a")
  if not ch[idx]:
    print(-1)
    break
  temp = bisect.bisect_right(ch[idx], now)
  ans += ch[idx][temp] - now
  now = ch[idx][temp]%l
else:
  print(ans)