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 sys,os,math
from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat
import Queue


# sys.stdin = open('input')
# n, k = map(int, raw_input().split())
# da = map(int, raw_input().split())
# db = map(int, raw_input().split())


def main():
    s = raw_input().strip()
    t = raw_input().strip()
    d = defaultdict(list)
    for idx, c in enumerate(s):
        d[c].append(idx)
    i, offset = 1, -1
    for c in t:
        idx = bisect.bisect_right(d[c], offset)
        if not d[c]:
            print -1
            return
        if idx == len(d[c]):
            i+=1
            offset = d[c][0]
        else:
            offset = d[c][idx]
    print (i-1)*len(s)+offset+1






main()
