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

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		char[] t = sc.next().toCharArray();
		sc.close();

		List<TreeSet<Integer>> list = new ArrayList<>();
		for (int i = 0; i < 26; i++) {
			list.add(new TreeSet<>());
		}
		for (int i = 0; i < s.length; i++) {
			int c = s[i] - 'a';
			list.get(c).add(i);
			list.get(c).add(i + s.length);
		}

		long a = 0;
		int now = -1;
		for (int i = 0; i < t.length; i++) {
			int c = t[i] - 'a';
			Integer next = list.get(c).higher(now);
			if (next == null) {
				System.out.println(-1);
				return;
			}
			if (next >= s.length) {
				a++;
				next -= s.length;
			}
			now = next;
		}
		System.out.println(a * s.length + now + 1);
	}
}
