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.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();
        Map<Character, List<Integer>> si = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            List<Integer> list = si.get(c);
            if (list == null) {
                list = new ArrayList<>();
                si.put(c,list);
            }
            list.add(i+1);
        }

        boolean found = true;
        int unit = 0;
        long ans = 0;
        int now = 0;
        for (int i = 0; i < t.length(); i++) {
            char c = t.charAt(i);
            if (!si.containsKey(c)) {
                found = false;
                break;
            }
            List<Integer> list = si.get(c);
            if (list.get(list.size()-1) <= now) {
                unit++;
                now = list.get(0);
            } else {
                now = find(list, now+1);
            }
            ans = (long)unit*s.length()+now;
        }

        System.out.println(found ? ans : -1);
    }

    private static int find(List<Integer> list, int key) {

        int ng = -1;
        int ok = list.size()-1;

        while (ng+1 < ok) {
            int mid = (ok+ng)/2;
            if (list.get(mid) >= key) {
                ok = mid;
            } else {
                ng = mid;
            }
        }

        return list.get(ok);
    }
}
