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;
#define M 100005
char s[M],t[M];
int nxt[30][M],pre[30];
int main(){
	cin>>s+1>>t+1;
	int l1=strlen(s+1),l2=strlen(t+1);
	for(int i=l1*2;i>l1;--i)pre[s[i-l1]-'a']=i-l1;
	for(int i=l1;i>=0;--i){
		for(int j=0;j<26;++j)nxt[j][i]=pre[j];
		if(i)pre[s[i]-'a']=i;
	}
	int id=1,p=0;
	long long ans=0;
	while(id<=l2){
		int q=nxt[t[id]-'a'][p];
		if(!q){
			puts("-1");
			return 0;
		}
		if(p>=q){
			ans+=q+l1-p;
			p=q;
			++id;
		}else {
			ans+=q-p;
			p=q;
			++id;
		}
	}
	printf("%lld",ans);
	return 0;
}