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;

signed main() {
  string s,t;
  cin >> s >> t;
  map<char,set<int>> mp;
  for(int i=0; i<s.size(); i++) {
    char c = s[i];
    if(mp.count(c)) mp[c].insert(i);
    else mp[c] = set<int>({i});
  }

  long long ans = 0;
  int pos = 0;
  for(auto c : t) {
    set<int>& p = mp[c];
    auto it = p.lower_bound(pos);
    if(it == p.end()) {
      ans += s.size();
      pos = 0;
      it = p.lower_bound(pos);
      if(it == p.end()) {puts("-1"); return 0;}
    }

    pos = (*it) + 1;
    //cout << c << " " << pos << " " << ans << endl;
  }
  ans += pos;
  cout << ans << endl;
}
