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 N 100005
using namespace std;
typedef long long LL;
char s[N],t[N];
vector<int> p[30];
LL n,m;
int main()
{
	scanf("%s%s",s+1,t+1);
	n=strlen(s+1);
	for(int i=1;i<=n;i++)p[s[i]-'a'].push_back(i);
	for(int i=1;i<=n;i++)p[s[i]-'a'].push_back(i+n);
	m=strlen(t+1);
	LL k=0,q=0;
	for(int i=1;i<=m;i++)
	{
		LL x=t[i]-'a',v=upper_bound(p[x].begin(),p[x].end(),q)-p[x].begin();
		if(v==p[x].size())
		{
			puts("-1");
			return 0;
		}
		q=p[x][v];
		while(q>n)k++,q-=n;
	}
	printf("%lld\n",k*n+q);
	return 0;
}