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 <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
char s[100005],t[100005];
vector<int> a[35];
int main()
{
 cin>>(s+1);
 cin>>(t+1);
 int lens=strlen(s+1),lent=strlen(t+1);
 for(int i=1;i<=lens;i++)
  a[s[i]-'a'].push_back(i);
 for(int i=1;i<=lent;i++)
  if(a[t[i]-'a'].empty())
  {
   cout<<-1<<endl;
   return 0;
  }
 int cur=0,cnt=0;
 for(int i=1;i<=lent;i++)
 {
  int num=t[i]-'a';
  auto tmp=upper_bound(a[num].begin(),a[num].end(),cur);
  if(tmp==a[num].end())
  {
   cnt++;
   cur=*a[num].begin();
  }
  else cur=*tmp;
 }
 cout<<1ll*cnt*lens+cur<<endl;
 return 0;
}