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 ll long long
using namespace std;
const int MAXN=200010;
int n,m,nx[MAXN][27];
ll cnt,cur;
char c[MAXN],t[MAXN];
int main () {
	scanf("%s%s",c+1,t+1);
	n=strlen(c+1),m=strlen(t+1);
	for (int i=n+1;i<=2*n;i++) {c[i]=c[i-n];}
	for (int i=0;i<=25;i++) {nx[2*n][i]=2*n+1;}
	for (int i=2*n-1;i>=0;i--) {
		for (int j=0;j<=25;j++) {
			nx[i][j]=((c[i+1]=='a'+j)?i+1:nx[i+1][j]);
		}
	}
	for (int i=1;i<=m;i++) {
		if (nx[cur][t[i]-'a']==2*n+1) {printf("-1");return 0;}
		if (nx[cur][t[i]-'a']>n) {cnt++,cur=nx[cur][t[i]-'a']-n;}
		else {cur=nx[cur][t[i]-'a'];}
	}
	printf("%lld\n",cnt*n+cur);
	return 0;
}