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.Scanner;
import java.util.TreeSet;

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();

		// アルファベット分TreeSetを用意
		TreeSet<Integer>[] sets = new TreeSet[26];
		for (int i = 0; i < sets.length; i++) {
			sets[i] = new TreeSet<Integer>();
		}

		// アルファベットに要素順を設定
		for (int i=0; i < sChars.length; i++) {
			sets[sChars[i] - 'a'].add(i);
		}

		int lastIndex = 0;
		long ans = 0;
		for (char c : tChars) {
			Integer tmpIndex = sets[c - 'a'].ceiling(lastIndex);
			if (tmpIndex == null) {
				lastIndex = 0;
				ans += N;
				tmpIndex = sets[c - 'a'].ceiling(lastIndex);
				if (tmpIndex == null) {
					System.out.println(-1);
					return;
				}
			}
			lastIndex = tmpIndex + 1;
		}
		ans = ans + (long)(lastIndex);
		System.out.println(ans);
	}
}
