链接：https://codeforces.com/contest/1295/problem/C

You are given two strings ss and tt consisting of lowercase Latin letters. Also you have a string zz which is initially empty. You want string zz to be equal to string tt. You can perform the following operation to achieve this: append any subsequence of ss at the end of string zz. A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements. For example, if z=acz=ac, s=abcdes=abcde, you may turn zz into following strings in one operation:

  1. z=acacez=acace (if we choose subsequence aceace);
  2. z=acbcdz=acbcd (if we choose subsequence bcdbcd);
  3. z=acbcez=acbce (if we choose subsequence bcebce).

Note that after this operation string ss doesn't change.

Calculate the minimum number of such operations to turn string zz into string tt.

Input

The first line contains the integer TT (1≤T≤1001≤T≤100) — the number of test cases.

The first line of each testcase contains one string ss (1≤|s|≤1051≤|s|≤105) consisting of lowercase Latin letters.

The second line of each testcase contains one string tt (1≤|t|≤1051≤|t|≤105) consisting of lowercase Latin letters.

It is guaranteed that the total length of all strings ss and tt in the input does not exceed 2⋅1052⋅105.

Output

For each testcase, print one integer — the minimum number of operations to turn string zz into string tt. If it's impossible print −1−1.

Example

input

Copy

3
aabce
ace
abacaba
aax
ty
yyt

output

Copy

1
-1
3

代码：

#include<bits/stdc++.h>
using namespace std;
char a[100005],b[100005];
long long p[100005][26],n,m;
int main(){
	long long t;
	scanf("%lld\n",&t);
	while(t--)
	{
		scanf("%s",a);
		scanf("%s",b);
		n=strlen(a);
		m=strlen(b);
		for(int i=0;i<26;i++) 
		{
			p[n][i]=-1;
		} 
		for(int i=n-1;i>=0;i--)
		{
			for(int j=0;j<26;j++) 
			p[i][j]=p[i+1][j];
			p[i][a[i]-'a']=i;
		}
		long long ans=1,pe=0,flag=0;
		while(pe<m)
		{
			if(p[flag][b[pe]-'a']==-1)
			{
				if(flag==0)
				{
					ans=-1;
					break;
				}
				else
				{
					flag=0,ans++;
					continue;
				}
			}
			flag=p[flag][b[pe]-'a']+1;
			pe++;
		}
		printf("%d\n",ans);
	}
	return 0;
}