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;


int main(){
	string s,t;
	cin>>s>>t;	
	
	int n = (int)s.length();
	int m = (int)t.length();
	vector<vector<int>> S(26);


	for(int i = 0; i < n; i++) S[s[i]-'a'].push_back(i);
	for(int i = 0; i < n; i++) S[s[i]-'a'].push_back(i+n);
	long long ans = 0; 
	
	int p = 0;

	for(int i = 0; i < m; i++){
		int c = t[i] - 'a';
		if(S[c].size() == 0){
			cout<<-1;
			return 0;
		}
		p = *lower_bound(S[c].begin(),S[c].end(),p)+1;
		if(p>=n){
			p-=n;
			ans+=n;
		}
	}

	cout<<ans+p;

}