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>
#define rep(i,n) for(int i=0; i<(int)(n); i++)

using namespace std;
using LL = long long;

int main(){
	string s, t;
	cin >> s >> t;
	s+=s;
	LL ans=0, prev=-1;
	vector<vector<LL>> chara(26);
	rep(i,s.size()){
		int c=s[i]-'a';
		chara[c].emplace_back(i);
	}
	rep(i,t.size()){
		int c=t[i]-'a';
		auto itr=upper_bound(chara[c].begin(),chara[c].end(),prev);
		if(itr==chara[c].end()){
			cout << -1 << endl;
			return 0;
		}
		LL num=*itr;
		ans+=num-prev;
		if(num>=s.size()/2) prev=num-s.size()/2;
		else prev=num;
	}
	cout << ans << endl;

	return 0;
}