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 < (n); ++i)
using namespace std;
typedef long long ll;

int main(){
	string s,t;
	cin >> s;
	cin >> t;
	
	string ss = s + s;
	vector<vector<int>> locate(26);
	rep(i,ss.size()){
		locate[ss[i] - 'a'].push_back(i);
	}
	
	ll res = 0;
	int p = 0;
	rep(i,t.size()){
		int nowch = t[i] - 'a';
		if(locate[nowch].empty()){
			cout << -1 << endl;
			return 0;
		}
		int np = *lower_bound(locate[nowch].begin(), locate[nowch].end(), p)+1;
		res += np - p;
		p = np;
		if(p >= s.size()) p -= s.size();
	}
	
	
	cout << res << endl;
	return 0;
}