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 int long long
using namespace std;
const int maxn=2e5+10;
string a,b;
int p[100],f[50][maxn],ans,pos,pre;
signed main()
{
	cin>>a>>b;
	a=a+a;
	int lena=a.length(),lenb=b.length();
	for(register int i=1;i<=26;i++)
		p[i]=-1;
	for(register int j=lena-1;j>=0;j--)
	{
		for(register int i=1;i<=26;i++)
			f[i][j]=p[i];
		p[a[j]-96]=j;
	}
	for(register int i=0;i<lenb;i++)
		if(p[b[i]-96]==-1)
		{
			puts("-1");
			return 0;
		}
	pos=p[b[0]-96];
	ans+=pos;
	pre=pos;
	for(register int i=1;i<lenb;i++)
	{
		pos=f[b[i]-96][pre];
		ans+=pos-pre;
		pre=pos%(lena/2);
	}
	printf("%lld",ans+1);
	return 0;
}