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;

string s,t;
int ls,lt,st,cnt;
vector<int> pos[26];

int main()
{
	cin>>s>>t;
	ls=s.size(),lt=t.size();
	for(int i=0;i<ls;++i) pos[s[i]-'a'].push_back(i+1);
	for(int i=0;i<ls;++i) pos[s[i]-'a'].push_back(i+ls+1);
	for(int i=0;i<lt;++i) {
		if(pos[t[i]-'a'].size()==0) {
			cout<<-1;
			return 0;
		}
		st=*upper_bound(pos[t[i]-'a'].begin(),pos[t[i]-'a'].end(),st);
		if(st>ls) cnt++,st-=ls;
	}
	printf("%lld",1ll*cnt*ls+st);
}