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<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
#define N 100002
char s[N],t[N];
vector<int>p[30];
int main()
{
	scanf("%s%s",s+1,t+1);
	int ls=strlen(s+1),lt=strlen(t+1);
	for(int i=1;i<=ls;i++)
		p[s[i]-'a'].push_back(i);
	ll las=0,ans=0;
	for(int i=1;i<=lt;i++)
	{
		int a=t[i]-'a',siz=p[a].size();
		if(siz==0)
		{
			printf("-1");
			return 0;
		}
		if(p[a][siz-1]<=las)las=0,ans+=ls;
		las=*upper_bound(p[a].begin(),p[a].end(),las);
	}
	printf("%lld",ans+las);
}