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"
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std; 
typedef pair<int, int> P;

int main() {
	string S, T;
	cin >> S >> T;
	string S2 = S + S;
	long long ans = -1;
	for (int n = 0;n<T.size();++n) {
		string S3 = S2.substr((1 + ans)%S.size());
		int anstmp = S3.find(T[n]);
		if (string::npos == anstmp) {
			cout <<"-1" <<endl;
			return 0;
		}
		ans += (long long)anstmp + 1;
	}
	cout << ans + 1 <<endl;
	return 0;
} 