CodeForces - 1295C C - Obtain The String

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

3
aabce
ace
abacaba
aax
ty
yyt

Output

1
-1
3

貌似有朴素二分写法 但是借此机会学习一下序列自动机（不连续的KMP）

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int T;
char s[maxn];
int now[30];//记录字母最早出现的位置
char t[maxn];
int nex[maxn][30];//nex[i][j]记录在主串第i个字符之后（'a'+j)第一次出现的位置
void init() {
    memset(now,-1,sizeof(now));
    int len  = strlen(s + 1);
    for(int i = len; i >= 0; i--) {
        for(int j = 0; j < 26; j++) {
            nex[i][j] = now[j];//初始now[]均为-1，在主串最后一个字符，在主串最后一个字符没有字符了
        }
        if(i)
            now[s[i] - 'a'] = i;//不断更新，记录字母最早出现的位置
    }
}
int main() {
    cin >> T;
    while(T--) {
        scanf("%s%s",s+1,t+1);
        init();
        int pos = 0;
        int ans = 1;
        bool f = 0;
        int len = strlen(t + 1);
        for(int i = 1; i <= len; i++) {
            int r = t[i] - 'a';
            if(nex[pos][r] == -1) {
                if(nex[0][r] == -1) {
                    f = 1;
                    break;
                }
                ans++;
                pos = 0;
            }
            pos = nex[pos][r];
        }
        if(f == 1) {
            ans = -1;
        }
        printf("%d\n",ans);
    }
}