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 <iostream>
#include <map>
using namespace std;

int main() {
  string s, t;
  cin >> s >> t;
  map<char, int> index, next[s.size()];
  for (int i = s.size() - 1; i >= 0; --i) {
    index[s[i]] = s.size() + i;
  }
  for (int i = s.size() - 1; i >= 0; --i) {
    index[s[i]] = i;
    next[i] = index;
  }
  int64_t result = 0;
  for (int64_t i = 0; i < t.size(); ++i) {
    auto it = next[result % s.size()].find(t[i]);
    if (it == next[result % s.size()].end()) {
      result = -1;
      break;
    }
    result += it->second - result % s.size() + 1;
  }
  cout << result;
  return 0;
}