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>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

bool NG(string s, string t){
    map<char,int>mp1,mp2;
    rep(i,s.size())mp1[s[i]]++;
    rep(i,t.size())mp2[t[i]]++;
    for(auto&p:mp2){
        if(mp1[p.first]==0)return true;
    }
    return false;
}

int main(){
    string s,t;
    cin>>s>>t;
    int n=s.size();
    if(NG(s,t)){cout<<-1<<endl; return 0;}
    s+=s;
    ll ans=0;
    rep(i,t.size()){
        string x=s.substr(ans%n);
        int next=x.find(t[i]);
        ans+=next+1;
    }
    cout<<ans<<endl;
}