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;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    string s, t;
    cin >> s >> t;

    map<char, set<int>> chars;
    for (int i = 0; i < s.size(); i++) {
        chars[s[i]].insert(i);
        chars[s[i]].insert(i + s.size());
    }
    int64_t ret = 0;
    for (int i = 0; i < t.size(); i++) {
        if (chars[t[i]].empty()) {
            ret = -1;
            break;
        }
        int p = ret % s.size();
        auto it = chars[t[i]].lower_bound(p);
        ret += *it - p + 1;
    }

    cout << ret << endl;

    return 0;
}
