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 main() {
	string s, t;
	cin >> s >> t;
	map<char, int> mp;
	for (int i = 0; i < (int) s.length(); i++) {
		mp[s[i]]++;
	}
	bool ok = true;
	for (int i = 0; i < (int)t.length(); i++) {
		if (mp[t[i]] <= 0) ok = false;
	}
	if (!ok) {
		cout << -1 << endl;
		return 0;
	}
	long long last = 0;
	long long sum = 0;
	long long n = s.length();
	for (int i = 0; i < (int)t.length(); i++) {
		int x = s.substr(last, n-last).find(t[i]);
		if (x == -1) {
			sum += n - last;
			x = s.find(t[i]);
			last = 0;
		}
		sum += x +1ll;
		
		last += x+1ll;
	}
	cout << sum;
	return 0;
}