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);
		String s = sc.next();
		String t = sc.next();
		BitSet[] ind = new BitSet[26];
		for (int i = 0; i < 26; i++)
			ind[i] = new BitSet();
		for (int i = 0; i < s.length(); i++)
			ind[s.charAt(i) - 'a'].set(i);
		for (int i = 0; i < t.length(); i++) {
			if (ind[t.charAt(i) - 'a'].isEmpty()) {
				System.out.println(-1);
				return;
			}
		}
		int k = 0, j = 0;
		long ans = 0;
		while (k < t.length()) {
			j = ind[t.charAt(k) - 'a'].nextSetBit(j);
			if (j < 0) {
				ans++;
				j = 0;
			} else {
				k++;
				j++;
			}
		}
		System.out.println(ans * s.length() + j);
	}
}