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;
typedef long long LL;
set<int>  st[125];
int main()
{
  //freopen("input.txt","r",stdin);
   string s,t;
   cin>>s>>t;
   for(int i = 0;i<s.size();++i)
   {
       st[s[i]].insert(i);
   }
   int a = 0,b = 0;
   for(int i = 0;i<t.size();++i)
   {
       if(st[t[i]].empty()) return cout<<-1,0;
       if(st[t[i]].lower_bound(b)==st[t[i]].end()) a++,b = 0;
       b = *st[t[i]].lower_bound(b);
       b++;
   }
   cout<<a*s.size()+b<<endl;
}
