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;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;

int main(){
  string s, t;
  cin >> s >> t;
  vector<vector<int>> ch(26);
  int n = s.size(), m = t.size();
  rep(i, n) ch[s[i]-'a'].push_back(i);
  rep(i, n) ch[s[i]-'a'].push_back(i + n);

  ll ans = 0;
  int it = 0;
  rep(i, m) {
    int c = t[i] - 'a';
    if(ch[c].size() == 0) {
      puts("-1");
      return 0;
    }
    it = *lower_bound(ch[c].begin(), ch[c].end(), it) + 1;
    if(it >= n) {
      ans += n;
      it -= n;
    }
    
  }
  ans += it;
  cout << ans << endl;
}