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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
	static private class Pat {
		List<Integer> of = new ArrayList<Integer>();;
	}

	static Pat[] pat = new Pat[26];

	public static void main(String[] args) {
		Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		String s = in.next();
		String t = in.next();
		for (int i = 0; i < pat.length; i++)
			pat[i] = new Pat();
		getPat(s);
		System.out.println(solve(t, s.length()));
	}

	private static long solve(String t, int slen) {
		long ans = 0;
		int d = 0;
		for (int i = 0; i < t.length(); i++) {
			int dn = searchPat(t.charAt(i), d);
			if (dn == 0)
				return -1;
			if (dn < 0) {
				ans += slen;
				d = 0;
				i--;
			} else
				d = dn;
		}
		return ans + d;
	}

	private static int searchPat(char c, int d) {
		int p = c - 'a';
		if (pat[p].of.isEmpty())
			return 0;
		int end = pat[p].of.size();
		if (pat[p].of.get(end - 1) <= d)
			return -1;
		return searchBin(p, d, 0, end);
	}

	private static int searchBin(int p, int d, int s, int e) {
		if (s == e)
			return pat[p].of.get(s);
		int m = (s + e) / 2;
		if (pat[p].of.get(m) > d)
			return searchBin(p, d, s, m);
		else
			return searchBin(p, d, m + 1, e);
	}

	private static void getPat(String s) {
		for (int i = 0; i < s.length(); i++)
			pat[s.charAt(i) - 'a'].of.add(i + 1);
	}
}