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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

vector<int> v[256];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	string s, t; cin >> s >> t;
	for (int i = 0; i < s.length(); i++) 
		v[s[i]].push_back(i + 1);
	long long ans = 0;
	int p = 0;
	for (int i = 0; i < t.length(); i++) {
		if (v[t[i]].empty()) {
			cout << -1 << '\n';
			return 0;
		}
		if (v[t[i]].back() <= p) {
			ans += (int)s.length();
			p = 0;
		}
		p = (*upper_bound(v[t[i]].begin(), v[t[i]].end(), p));
	}
	ans += p;
	cout << ans << '\n';
	return 0;
}	