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
S = input() 
T = input() 

if __name__ == "__main__":
    n = len(S)
    ans = 0
    pre = -1 
    for c in T: 
        pos = S.find(c, pre + 1, n)
        if pos != -1:
            ans += (pos - pre)
            pre = pos 
        else:
            pos = S.find(c, 0, pre + 1)
            if pos != -1:
                ans += n + pos - pre
                pre = pos  
            else:
                ans = -1
                break
    
    print(ans)
