#include "bits/stdc++.h"

using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using ll = long long;
using pii = pair<int, int>;

int c_s[26], c_t[26];
void solve(int TC) {
	string s, t; cin >> s >> t;
	for(int i = 0; i < 26; i++) c_s[i] = c_t[i] = 0;
	for(auto c : s) c_s[c - 'a']++;
	for(auto c : t) c_t[c - 'a']++;

	int mx = 1 << 30, cnt = 0;
	for(int i = 0; i < 26; i++){
		if(c_t[i]) mx = min(mx, c_s[i] / c_t[i]), cnt++;
	}
	if(cnt == 1){
		int x = -1; for(int i = 0; i < 26; i++) if(c_t[i]) x = i;
		cout << max(0, c_s[x] - c_t[x] + 1) << '\n';
	}else{
		cout << mx << '\n';
	}
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

	int t = 1;
	cin >> t;
	for (int i = 1; i <= t; i++) {
		solve(i);
	}
}