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 <algorithm>
#include <iostream>
#include <string>
#include <vector>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int main(){
	string s,t; cin>>s>>t;
	int n=s.length();

	vector<int> pos[128];
	rep(i,n) pos[s[i]].emplace_back(i);

	int cnt=0,idx=-1;
	for(char c:t){
		if(pos[c].empty()){ cout<<-1<<endl; return 0; }

		auto it=upper_bound(pos[c].begin(),pos[c].end(),idx);
		if(it!=pos[c].end()){
			idx=*it;
		}
		else{
			cnt++;
			idx=pos[c][0];
		}
	}
	cout<<(long long)n*cnt+idx+1<<endl;

	return 0;
}
