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

/**
 * Strings of Impurity
 */
public class Main {

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

            @SuppressWarnings("unchecked")
            List<Integer>[] clist = new List[26];
            for (int i = 0; i < 26; i++) {
                clist[i] = new ArrayList<Integer>();
            }

            for (int i = 0; i < S.length(); i++) {
                clist[(int) (S.charAt(i) - 97)].add(i);
            }

            int[][] index = new int[26][];
            for (int i = 0; i < 26; i++) {
                index[i] = clist[i].stream().mapToInt(Integer::intValue).toArray();
            }

            long con = 0;
            int pre = -1;
            for (char c : T.toCharArray()) {
                int[] idx = index[(int) (c - 97)];
                if (idx.length == 0) {
                    System.out.println(-1);
                    return;
                }

                int pos = Arrays.binarySearch(idx, pre + 1);

                int i;
                if (pos >= 0) {
                    i = idx[pos];
                } else {
                    pos = -(pos + 1);
                    if (pos < idx.length) {
                        i = idx[pos];
                    } else {
                        con++;
                        i = idx[0];
                    }
                }

                pre = i;
            }

            System.out.println(con * S.length() + pre + 1);
        }
    }

}
