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
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

const int ML=200100;

char s[ML],t[ML];

int nx[ML][26],tmp[26];

int main()
{
	scanf("%s%s",s,t);
	
	int n=strlen(s),m=strlen(t);
	
	for (int i=n; i<(n<<1); i++) s[i]=s[i-n];
	
	for (int i=0; i<26; i++) tmp[i]=(n<<1);
	
	for (int i=(n<<1)-1; ~i; i--)
	{
		tmp[s[i]-'a']=i;
		
		for (int j=0; j<26; j++) nx[i][j]=tmp[j];
	}
	
	int ans=0,np;
	
	for (int i=0,p=-1; i<m; i++,p=np)
	{
		np=nx[p+1][t[i]-'a'];
		
		if (np>=n) ans++,np-=n;
		
		if (np==n) { ans=-1; break; }
	}
	
	if (~ans) cout<<0LL+np+1LL*ans*n+1; else cout<<-1;
	
	return 0;
}