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 java.util.Arrays;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        TreeSet<Integer>[] idx = new TreeSet[26];
        for (int i = 0; i < 26; i++) {
            idx[i] = new TreeSet<>();
        }

        boolean exist[] = new boolean[26];
        for (int i = 0; i < S.length(); i++) {
            int pos = S.charAt(i) - 'a';
            idx[pos].add(i);
            exist[pos] = true;
        }

        long ans = 0;
        int pos = -1;

        int tidx = 0;
        for (;tidx < T.length();) {
            int t = T.charAt(tidx) - 'a';
            if (!exist[t]) {
                System.out.println(-1);
                return;
            }
            Integer npos = idx[t].higher(pos);
            if (npos == null) {
                ans += (S.length() - 1) - pos; // go to $
                pos = -1;
            } else {
                ans += npos - pos;
                pos = npos;
                tidx++;
            }
        }
        System.out.println(ans);
    }
}