#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define endl '\n'
int t;
char s1[200005],s2[200005];
int n,m;
int nxt[200005][26];
int tong1[30],tong2[30];
vector<int>pos[30];
void solve(){
	scanf("%s",s1+1);scanf("%s",s2+1);
	n = strlen(s1+1),m = strlen(s2+1);
	memset(tong1,0,sizeof(tong1));memset(tong2,0,sizeof(tong2));
	for(int i =0;i<=26;i++)pos[i].clear();
	for(int i = 1;i<=n;i++)tong1[s1[i]-'a']++;
	for(int i = 1;i<=m;i++)tong2[s2[i]-'a']++;
	for(int i = 0;i<26;i++){
		if(tong2[i] and tong1[i] == 0){
			cout << -1 << '\n';return;
		}
	}for(int i = 1;i<=n;i++)s1[i+n] = s1[i];
	for(int i= 0;i<26;i++)pos[i].push_back(1);
	for(int i = 1;i<=2*n;i++)pos[s1[i]-'a'].push_back(i);
	for(int i =0;i<26;i++)pos[i].push_back(2*n+1);
//	cout << 111 << endl;
	for(int i =0;i<26;i++){
		for(int j = 0;j+1<pos[i].size();j++){
			for(int k = pos[i][j];k<min(pos[i][j+1],n+1);k++){
			//	cout << i << " " << j << " " << k << endl;
				nxt[k][i] = pos[i][j+1];
			}
		}
	}//cout << 111 << endl;
	int ans = 1,now = pos[s2[1]-'a'][1];
	//cout << now << endl;
	for(int i = 2;i<=m;i++){
		int nt = nxt[now][s2[i]-'a'];
	//	cout << nt << endl;
		if(nt>n)nt-=n,ans++;now = nt;
	}cout << ans << endl;
}
signed main(){
	cin >> t;
	while(t--){
		solve();
	}
	return 0;
}