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;

string s, t;

set<int> pos[200];

int main() {
	cin >> s >> t;
	for (int i = 0; i < (int)s.size(); i++)
		pos[(int)s[i]].insert(i);

	int at = 0;
	long long ans = 0;
	for (int c : t) {
		if (pos[c].empty()) goto bad;
		auto it = pos[c].lower_bound(at);
		if (it == pos[c].end()) {
			it = pos[c].begin();
			ans += s.size() - at;
			at = 0;
		}
		ans += *it + 1 - at;
		at = *it + 1;
	}
	cout << ans << '\n';
	return 0;

bad:
	cout << "-1\n";
	return 0;
}
