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<cstdio>
#include<cstring>
#define ll long long
using namespace std;
const int N=1e5+5;
int sl,tl,j,Fir[26],Las[26];
ll ans;
char S[N],T[N];
int main(){
	scanf("%s%s",S+1,T+1);
	sl=strlen(S+1),tl=strlen(T+1);
	for(int i=1;i<=sl;++i){
		if(!Fir[S[i]-'a'])Fir[S[i]-'a']=i;
		Las[S[i]-'a']=i;
	}
	j=Fir[T[1]-'a'];
	if(!j){
		printf("-1\n");
		return 0;
	}
	for(int i=2;i<=tl;++i){
		for(++j;j<=Las[T[i]-'a']&&T[i]!=S[j];++j);
		if(j>Las[T[i]-'a'])ans+=sl,j=Fir[T[i]-'a'];
		if(!j){
			printf("-1\n");
			return 0;
		}
	}
	printf("%lld\n",ans+j);
}