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[] first = sc.next().toCharArray();
		long len = first.length;
		TreeSet<Integer>[] sets = new TreeSet[26];
		for (int i = 0; i < sets.length; i++) {
			sets[i] = new TreeSet<Integer>();
		}
		for (int i = 0; i < len; i++) {
			sets[first[i] - 'a'].add(i);
		}
		char[] second = sc.next().toCharArray();
		int line = 0;
		int idx = 0;
		for (char c : second) {
			Integer x = sets[c - 'a'].ceiling(idx);
			if (x == null) {
				idx = 0;
				line++;
				x = sets[c - 'a'].ceiling(idx);
				if (x == null) {
					System.out.println(-1);
					return;
				}
			}
			idx = x.intValue() + 1;
		}
		System.out.println(len * line + idx);
	}
}
