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;
string s,t;
long long x[100],ans,a;
vector<int> v[100];
int main(){
	cin>>s>>t;a=s.size();
	for (int i=0;i<s.size();i++) x[s[i]-'a']++;
	for (int i=0;i<t.size();i++)
		if (x[t[i]-'a']==0){
			cout<<-1<<endl;
			return 0;
		}
	for (int i=0;i<s.size();i++) v[s[i]-'a'].push_back(i);
	int n=-1;
	for (int i=0;i<t.size();i++){
		int lbound=upper_bound(v[t[i]-'a'].begin(),v[t[i]-'a'].end(),n)-v[t[i]-'a'].begin();
		if (lbound>=v[t[i]-'a'].size()||v[t[i]-'a'][lbound]<=n){
			ans++;
			n=v[t[i]-'a'][0];
		}
		else
			n=v[t[i]-'a'][lbound];
	}
	cout<<ans*a+(long long)n+1<<endl;
	return 0;
}