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;
  vector<vector<int>> v(s.size(), vector<int>(1 << 8, -1));
  for (int _ = 0; _ < 2; _++) {
    for (int i = s.size() - 1; i >= 0; i--) {
      int j = (s.size() + i - 1) % s.size();
      v[j] = v[i];
      v[j][s[i]] = i;
    }
  }
  ll r = 0, p = 0;
  bool b = false;
  for (int i = s[0] == t[0]; i < t.size(); i++) {
    if (v[p][t[i]] == -1) {
      b = true;
      break;
    }
    if (v[p][t[i]] <= p) r++;
    p = v[p][t[i]];
  }
  cout << (b ? -1 : r * int(s.size()) + p + 1) << endl;
}
