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.io.PrintWriter;
import java.util.*;

public class Main {

    private static Scanner in = new Scanner(System.in);
    private static PrintWriter out = new PrintWriter(System.out);

    private static final long MOD = (long) 1e9 + 7;

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    private static void solve() {
        String s = in.next();
        String t = in.next();
        int sn = s.length();
        int tn = t.length();

        Map<Character, List<Integer>> sMap = new HashMap<>();
        char[] chars = s.toCharArray();
        for (int i = 0; i < chars.length; i++) {
            char ch = chars[i];
            if (sMap.containsKey(ch)) {
                sMap.get(ch).add(i);
            } else {
                List<Integer> l = new ArrayList<>();
                l.add(i);
                sMap.put(ch, l);
            }
        }

        Map<Character, int[]> map = new HashMap<>();
        sMap.forEach((k, v) -> {
            v.sort((Comparator.comparingInt(o -> o)));
            map.put(k, v.stream().mapToInt(i->i).toArray());
        });

        // out.println(sMap);
        long ans = 0;
        int before = -1;
        chars = t.toCharArray();
        for (char ch : chars) {
            int[] possible = map.get(ch);
            if (possible == null || possible.length == 0) {
                ans = -1;
                break;
            }

            int minIndex = nextIndex(possible, before, sn);
            int min = distance(minIndex, before, sn);
            ans += min;
            before = minIndex;
            // out.println("Char " + ch + " minIndex " + minIndex + " min " + min);
        }

        out.println(ans);
    }

    private static int nextIndex(int[] possible, int before, int sn) {
        int pt = Arrays.binarySearch(possible, before);
        // out.println("Binary search " + Arrays.toString(possible) + " before " + before + " result " + pt + " bit not " + ~pt);
        if (pt >= 0)
             return possible[(pt + 1) % possible.length];
        pt = ~pt;

        return possible[pt % possible.length];
    }

    private static int distance(int i, int before, int sn) {
        if (i == before)
            return sn;
        if (i > before)
            return i - before;
        return i + sn - before;
    }

}
