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;
using ll=long long;
int main(){
  string s,t; cin>>s>>t;
  int size=s.size();
  vector<vector<ll>> num(26);
  s+=s;
  for(ll i=0;i<s.size();i++){
    int x=s[int(i)]-'a';
    num[x].push_back(i+1);
  }
  int k=0;
  ll sum=0;
  for(int i=0;i<t.size();i++){
    int y=t[i]-'a';
    if(num[y].size()==0){
      cout<<-1<<endl;
      return 0;
    }
    int z=*lower_bound(num[y].begin(),num[y].end(),k);
    if(z>size){
      z-=size;
      sum+=size;
    }
    k=z+1;
  }
  cout<<sum+k-1<<endl;
}