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 scan = new Scanner(System.in);
		String s = scan.nextLine();
		String t = scan.nextLine();

		char[] sChars = s.toCharArray();
		char[] tChars = t.toCharArray();
		long N = s.length();
		long lastIndex = -1;

		// 文字と要素番号をマップに格納
		Map<Character, List<Integer>> map = new HashMap<>();
		List<Integer> tmpL = new ArrayList<>();
		for (int i = 0; i < sChars.length; i++) {
			tmpL = map.get(sChars[i]);
			if (tmpL == null) {
				tmpL = new ArrayList<>();
				map.put(sChars[i], tmpL);
			}
			tmpL.add(i);
		}

		// 文字列ｔの文字が文字列ｓに含まれるかチェック
		for (char c : tChars) {
			if (!map.containsKey(c)) {
				System.out.println(-1);
				return;
			}
		}

		Map<Character, Integer> beforeMap = new HashMap<>();
		long ans = 0;
		boolean exists = false;
		int start = 0;
		for (char c : tChars) {
			tmpL = map.get(c);
			Integer tmpI = beforeMap.get(c);
			if (tmpI != null) {
				start = tmpI + 1;
			}
			beforeMap.clear();

			// 続きから後ろを確認
			for (int i = start; i < tmpL.size(); i++) {
				if (tmpL.get(i) > lastIndex) {
					lastIndex = tmpL.get(i);
					beforeMap.put(c, i);
					exists = true;
					break;
				}
			}
			if (!exists) {
				ans += N;
				lastIndex = tmpL.get(0);
				beforeMap.put(c, 0);
			}
			else {
				exists = false;
			}
			start = 0;
		}
		ans = ans + (long)(lastIndex + 1);
		System.out.println(ans);
	}
}
