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 ll long long int
#define mm 1000000007
#define pb push_back
									//nestedcode



 int main(){
	ios::sync_with_stdio(false);
  	cin.tie(0); cout.tie(0);
  	string s,t;
  	ll n,nn,i,p=-1,ans=0;
  	map<char,vector<ll> > m;
    cin>>s>>t;
    n=s.length();
    nn=t.length();
    for(i=0;i<n;i++){
    	m[s[i]].pb(i);
	}
	for(i=0;i<nn;i++){
		if(m[t[i]].size() == 0){
			cout<<-1;
			return 0;
		}
		p=(upper_bound(m[t[i]].begin(),m[t[i]].end(),p)-m[t[i]].begin());
	
		if(p==m[t[i]].size()){
			ans++;
			p=m[t[i]][0];
		}else{
			p=m[t[i]][p];
		}	//cout<<p<<endl;
	}
	cout<<ans*n+p+1<<endl;
}