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<bits/stdc++.h>
using namespace std;
char a[100005],b[100005];
int n,m,x[26][100005],l[26];
long long ans;
int main(){
	scanf("%s %s",a+1,b+1);
	n=strlen(a+1),m=strlen(b+1);
	for(int i=1;i<=n;++i){
		x[a[i]-'a'][++l[a[i]-'a']]=i;
	}
	int z=0;
	for(int i=0;i<26;++i)x[i][++l[i]]=1e9;
	for(int i=1;i<=m;++i){
		int nw=b[i]-'a';
		if(l[nw]==1){ans=-1;break;}
		int w=x[nw][upper_bound(x[nw]+1,x[nw]+l[nw]+1,z)-x[nw]];
		if(w==1e9){
			w=x[nw][1];
			ans+=w+n-z;
		}
		else ans+=w-z; 
		z=w;
	}
	printf("%lld",ans);
}