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;

const int N = 1e5 + 10;
string s, t;
set<int> st[130];
long long a, b;

int main()
{
    ios_base::sync_with_stdio(false);
    cin >> s >> t;
    for (int i = 0, l = s.size(); i < l; i++)
        st[s[i]].insert(i);
    for (int i = 0, l = t.size(); i < l; i++)
    {
        if (st[t[i]].empty())
        {
            cout << -1 << endl;
            return 0;
        }
        if (st[t[i]].lower_bound(b) == st[t[i]].end())
        {
            a++;
            b = 0;
        }
        b = *st[t[i]].lower_bound(b);
        b++;
    }
    cout << a * s.size() + b << endl;
    return 0;
}