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;
char a[100050],b[100050];
int c[128],nx[100050][26],mp[26];
int main()
{
	cin>>(a+1)>>(b+1);
	int n=strlen(a+1);
	int m=strlen(b+1);
	for(int i=1;i<=n;i++)c[a[i]]++;
	for(int i=1;i<=m;i++)if(!c[b[i]])return puts("-1"),0;
	for(int i=1;i<=n;i++)a[i]-='a';
	for(int i=1;i<=m;i++)b[i]-='a';
	for(int i=0;i<26;i++)mp[i]=n+1;
	for(int i=n;i>=0;i--)
	{
		for(int j=0;j<26;j++)nx[i][j]=mp[j];
		mp[a[i]]=i;
	}
	long long ans=0;
	int now=0;
	for(int i=1;i<=m;i++)
	{
		if(nx[now][b[i]]==n+1)
		{
			ans+=n-now;
			now=0;
		}
		ans+=nx[now][b[i]]-now;
		now=nx[now][b[i]];
	}
	cout<<ans;
}