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;

template <class T> inline T updmax(T& a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T& a, T b) { return a = min(a, b); }

int ng() {
	cout << -1 << endl;
	return 0;
}

int nex[200005][26];
int tmp[26];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	string s, t;
	cin >> s >> t;
	int m = s.length();
	s = s + s + s;
	int x = -1;
	long long ans = 0;
	int n = t.length();
	for (int i = 0; i < n; i++) {
		size_t p = s.find(t[i], x + 1);
		if (p == string::npos) return ng();
		ans += p - x;
		x = p % m;
	}
	cout << ans << endl;
	return 0;
}