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;
const int N = 26;
string s, t;
vector<int> a[N];
long long pv = -1, ans[N], req, idx[N], n;
int main() {
	cin >> s >> t;

	for (auto c : t)
		if (s.find(c) == string::npos)
			return 0 * printf("-1");

	for (int i = 0; i < s.size(); i++)
		a[s[i] - 'a'].push_back(i);

	n = s.size();
	for (auto c : t) {
		int i = c - 'a';

		while (idx[i] < a[i].size() and pv >= a[i][idx[i]]) {
			idx[i]++;
		}

		if (idx[i] == a[i].size()) {
			req++;
			for (int i = 0; i < N; i++)
				idx[i] = 0;
		}

		ans[i] = 1ll * req * n + a[i][idx[i]];
		pv = a[i][idx[i]];
		idx[i]++;
	}

	cout << 1ll * req * n + pv + 1;
}