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>
#include <map>
using namespace std;

long n, m, p, ans;
string s, t;
char c;
map<char, vector<long>> a;

int main(){
	cin >> s >> t;
	n = s.size(); m = t.size();
	for (c = 'a'; c <= 'z'; ++c) a.emplace(c, vector<long>());
	for (int i = 0; i < n; ++i) a[s[i]].push_back(i);
	ans = 0;
	p = -1;
	for (int i = 0; i < m; ++i){
		c = t[i];
		if (a[c].empty()){
			printf("%d", -1);
			return 0;
		}
		if (p >= a[c].back()){
			p = -1;
			ans += n;
		}
		auto iter = upper_bound(a[c].begin(), a[c].end(), p);
		p = *iter;
	}
	ans += p + 1;
	printf("%ld", ans);
}