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;
const ll MOD = 1e9+7;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s,t;
  cin >> s >> t;
  ll l = s.size();
  vector<vector<ll>> v(26);
  for(ll i = 0; i < l; ++i){
    v[s[i]-'a'].push_back(i);
  }
  ll ans = 0,pos = -1;
  for(char c : t){
    ll idx = c-'a';
    if(v[idx].empty()){
      cout << -1;
      return 0;
    }
    auto it = lower_bound(begin(v[idx]),end(v[idx]),pos+1);
    if(it == end(v[idx])){
      ans += l;
      pos = v[idx][0];
    }
    else pos = *it;
  }
  cout << ans+pos+1;
  return 0;
}