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);
        
        char[] s = sc.next().toCharArray();
        char[] t = sc.next().toCharArray();
        
        TreeSet<Integer>[] al = new TreeSet[26];
        for(int i=0; i<26; i++){
            al[i] = new TreeSet<>();
        }
        
        int len = s.length;
        for(int i=0; i<len; i++){
            int idx = s[i]-97;
            al[idx].add(i);
        }
        
        long ans = 0L;
        int cur = -1;
        for(int i=0; i<t.length; i++){
            int idx = t[i]-97;
            Integer next = al[idx].higher(cur);
            if(next==null && al[idx].size()==0){
                System.out.println(-1);
                return;
            }else if(next==null){
                ans += len-cur-1;
                next = al[idx].higher(-1);
                ans += next+1;
                cur = next;
            }else{
                ans += next-cur;
                cur = next;
            }
        }
        
        System.out.println(ans);
        
    }
}
