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()
T = input()

memo = {}
for i, s in enumerate(S):
    if s not in memo:
        memo[s] = [i]
    else:
        memo[s].append(i)

cnt = 0
pre = -1
for t in T:
    if t not in memo:
        print(-1)
        quit()
    m = bisect_left(memo[t], pre + 1)
    if m >= len(memo[t]):
        cnt += 1
        pre = memo[t][0]
    else:
        pre = memo[t][m]

print(cnt * len(S) + pre + 1)