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.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
 
public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		char[] s = sc.nextLine().toCharArray();
		char[] t = sc.nextLine().toCharArray();
		
		Map<Character, List<Integer>> sMap = new HashMap<>();
		for (int i=0; i<s.length; i++) {
			List<Integer> l = sMap.get(s[i]);
			if (l == null) {
				l = new ArrayList<>();
				sMap.put(s[i], l);
			}
			l.add(i);
		}
		
		boolean contain = true;
		for (char c : t) {
			if (!sMap.containsKey(c)) {
				contain = false;
				break;
			}
		}
		
		if (!contain) {
			System.out.println(-1);
		}
		else {
			long cnt = 0;
			int length = s.length;
			for (char c : t) {
				List<Integer> l = sMap.get(c);
				cnt += getCnt(l, length, c);
			}
			System.out.println(cnt);
		}
	}
	
	private static int now = -1;
	private static Map<Character, Integer> nowMap = new HashMap<>();
	
	private static int getCnt(List<Integer> l, int length, char c) {
		int start = nowMap.containsKey(c) ? nowMap.get(c) + 1 : 0;
		for (int i=start; i<l.size(); i++) {
			int idx = l.get(i);
			if (idx > now) {
				int ret = now == -1 ? idx + 1 : idx - now;
				now  = idx;
				nowMap.put(c, i);
				return ret;
			}
		}
		int ret = now == -1 ? length : length - now - 1;
		now = -1;
		nowMap.clear();
		return getCnt(l, length, c) + ret;
	}
}