// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) {rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1];}

const int N = 2e6;
int T, c[26], d[26];
char s[N + 5], t[N + 5];

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	for(cin >> T; T--; ) {
		memset(c, 0, sizeof(c));
		memset(d, 0, sizeof(d));
		cin >> s + 1 >> t + 1;
		int a = strlen(s + 1), b = strlen(t + 1);
		rep(i, 1, a) ++c[s[i] - 'a'];
		rep(i, 1, b) ++d[t[i] - 'a'], --c[t[i] - 'a'];
		bool ans = 1;
		rep(i, 0, 25) if(c[i] < 0) ans = 0;
		if(!ans) {
			cout << "0\n";
			continue;
		}
		int res = 1;
		rep(i, 1, b) {
			bool is = 1;
			int mx = 1e9;
			rep(j, 0, 25) if(d[j]) {
				if(d[j] < i) {
					is = 0;
					break;
				}
				int x = d[j] / i, y = d[j] % i;
				if(x < y) {
					is = 0;
					break;
				}
				else {
					int z = (x - y) / (i + 1);
					x -= z, y += i * z;
					mx = min(mx, c[j] / x);
				}
			}
			if(is) res = max(mx + 1, res);
		}
		cout << res << '\n';
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}