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;

int nxt[100010][26];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	string s, t;
	cin >> s >> t;

	for (char alp = 'a'; alp <= 'z'; ++alp) {
		int pos = -1;
		for (int i = s.size(); i >= 0; --i) {
			nxt[i][alp - 'a'] = pos;
			if (i != 0 && s[i - 1] == alp) pos = i;
		}
	}

	long long ans = 0;
	for (int i = 0; i < t.size();) {
		int now = 0;
		if (nxt[0][t[i] - 'a'] == -1) {
			cout << -1;
			return 0;
		}
		while (i < t.size() && nxt[now][t[i] - 'a'] != -1) {
			now = nxt[now][t[i] - 'a'];
			i++;
		}
		if (i == t.size()) ans += now;
		else ans += s.size();
	}

	cout << ans;
}