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>

using namespace std;

int main()
{
	string s, t;

	cin >> s;
	cin >> t;

	long pos = 0;
	long count = 0;
	for ( long i = 0; i < t.size(); i ++ ) {
		pos = s.find( t[i], pos );
		if ( pos == -1 ) {
			pos = 0;
			pos = s.find( t[i], pos );
			if ( pos == -1 ) {
				cout << -1 << endl;
				return 0;
			}
			count ++;
		}
		pos ++;
	}

	cout << ( (long long)count * (long long)(s.size()) + (long long)(pos) ) << endl;
	

	return 0;
}