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 <iostream>
#include <vector>
#include <set>
#include <map>
using namespace std;

int main() {
	string s,t;
	cin >> s >> t;
	map<char,set<int>> m;
	for(int i=0;i<s.size();i++){
		m[s[i]].insert(i+1);
	}
	for(int i=0;i<t.size();i++){
		if(m.find(t[i]) == m.end()){
			cout << "-1\n";
			return 0;
		}
	}
	long long ans = 0;
	int curr = 0;
	for(int i=0;i<t.size();i++){
		auto it = m[t[i]].upper_bound(curr);
		if(it == m[t[i]].end()){
			ans += (long long)s.size();
			curr = 0;
			it = m[t[i]].upper_bound(curr);
		}
		curr = *it;
	}
	ans += curr;
	cout << ans << '\n';
	return 0;
}