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>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()

int main(){
	string S, T;
	cin >> S >> T;
	ll w = 0, m = -1;
	vector<ll> ch[300];
	for (int i = 0;i < S.size();i++) {
		ch[S[i]].push_back(i);
	}
	for (int i = 0;i < T.size();i++) {
		auto it = upper_bound(all(ch[T[i]]), m);
		if (it != ch[T[i]].end()) {
			m = *it;
		}
		else {
			w++;
			it = upper_bound(all(ch[T[i]]), -1);
			if (it == ch[T[i]].end()) {
				cout << -1 << endl;
				return 0;
			}
			m = *it;
		}
	}
	ll ans = w * S.size() + m + 1;
	cout << ans << endl;
}