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;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
string s,t;
  cin >>s>>t;
  string ss = s;
  int tlong = t.size();
  int64_t ans =0;
  int64_t x =0;
  for(int i =0;i<tlong;i++){
    x = ss.find_first_of(t.at(i));
    ss.erase(ss.begin(),ss.begin()+x+1);
    if(ss.size()<s.size()) ss +=s;
    //cout <<x+1<<endl;
    if(x>=0) ans +=x+1;
    else{
    ans = -1;
      break;
    }
  }
  cout << ans;
}