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 maxn 100005
#define ll long long
using namespace std;
char s[maxn*2];
int last[maxn*2][26],v[26];
int main(){
	scanf("%s",s+1);
	int n=strlen(s+1);
	for (int i=1;i<=n;i++)
	s[i+n]=s[i];
	for (int i=2*n;i>=0;i--){
		for (int j=0;j<26;j++)
		last[i][j]=v[j];
		if (i)v[s[i]-'a']=i;
	}
	scanf("%s",s+1);
	int m=strlen(s+1);
	int now=last[0][s[1]-'a'];
	ll ans=now;
	for (int i=2;i<=m;i++){
		if (!now) return printf("-1\n"),0;
		ans+=last[now][s[i]-'a']-now;
		now=last[now][s[i]-'a'];
		if (now>n) now-=n;
	}
	if (!now) ans=-1;
	printf("%lld\n",ans);
	return 0; 
} 