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;

long long solve() {
  string s, t; cin >> s >> t;
  s += s;
  const size_t n2 = s.size();
  const size_t n = n2 / 2;
  const size_t m = t.size();
  vector<vector<size_t>> pos(26);
  for (size_t i = 0; i < n2; i++) {
    pos[s[i]-'a'].push_back(i+1);
  }
  for (size_t i = 0; i < 26; i++) {
    pos[i].push_back(n2+1);
  }
  long long p = 0;
  for (size_t i = 0; i < m; i++) {
    size_t pm = p % n;
    const auto& v = pos[t[i]-'a'];
    size_t next = *upper_bound(v.cbegin(), v.cend(), pm);
    if (next == n2+1) return -1;
    p += next - pm;
  }
  return p;
}

int main() {
  cout << solve() << endl;
}