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;

int main(){
  string S,T;
  long long ans=0;
  cin >> S >> T;
  int N = S.size() , M = T.size();
  
  vector<vector<int>> V('z'+1,vector<int>(0));
  for(int i=0;i<N;i++) V[S[i]].push_back(i);
  
  for(int i=0;i<M;i++){
    if(V[T[i]].size()==0){
      cout << -1 << endl;
      return 0;
    }
    int x = ans%N;
    int y;
    auto it = V[T[i]].end();
    it--;
    if(x>*it) y = V[T[i]][0];
    else y = *lower_bound(V[T[i]].begin(),V[T[i]].end(),x);
    if(y>=x) ans += y-x+1;
    else ans += (N-x)+y+1;
  }
  
  cout << ans << endl;
  return 0;
}
