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 int int64_t
using namespace std;

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	string s,t;
	cin >> s >> t;
	int n=s.size(),ans = 0;
	map<char,vector<int>> m;
	for (int i=0; i<n; ++i){
		m[s[i]].emplace_back(i);
	}
	int ts = t.size(), crt = -1;
	for (int i=0; i<ts; ++i){
		if (!m.count(t[i])){
			cout << -1;
			return 0;
		}
		int pos = upper_bound(m[t[i]].begin(),m[t[i]].end(),crt)-m[t[i]].begin();
		if (pos >= m[t[i]].size()){
			ans += n;
			pos %= m[t[i]].size();
		}
		crt = m[t[i]][pos];
	}
	if (crt == -1) crt = 0;
	cout << ans+crt+1;
	return 0;
}
