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 <string>
#include <unordered_set>

using namespace std;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s, t;
	cin >> s >> t;
	unordered_set<char> us;
	for (auto&& ch : s)
		us.insert(ch);
	for (auto&& ch : t)
		if (us.find(ch) == us.end()) {
			cout << -1;
			return 0;
		}
	size_t pos = 0, res = 0;
	for (auto&& ch : t) {
		auto tmp = s.find(ch, pos);
		if (tmp != string::npos)
			pos = tmp + 1;
		else {
			res += s.size();
			pos = s.find(ch) + 1;
		}
	}
	cout << res + pos;
}