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 >> t;
	
	int n = int(s.size());
	int m = int(t.size());
	
	vector<vector<int>> is(26);
	rep(i, n) is[ s[i] - 'a' ].push_back(i);
	rep(i, n) is[ s[i] - 'a' ].push_back(i+n);
	
	ll ans;
	
	int p = 0;
	
	rep(i, m){
		int c = t[i] - 'a';
		if(int(is[c].size()) == 0){
			puts("-1");
			return 0;
		}
		p = *lower_bound(is[c].begin(), is[c].end(), p)+1;
		if(p >= n){
			p -= n;
			ans += n;
		}
		
	}
	ans += p;
	cout << ans << endl;
	return 0;
}