#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
    string s, t;
    cin >> s >> t;
    vector<int> fs(26);
    for (char c : s) {
        fs[c - 'a']++;
    }
    vector<int> ft(26);
    for (char c : t) {
        ft[c - 'a']++;
    }
    int mn = 1e9;
    for (int i = 0; i < 26; i++) {
        if (ft[i] > 0) {
            mn = min(mn, ft[i]);
        }
    }
    vector<int> a(26);
    for (int i = 0; i < 26; i++) {
        a[i] = ft[i] / mn;
        ft[i] %= mn;
    }
    int c = 1e9;
    vector<int> b(26);
    for (int i = 0; i < 26; i++) {
        if (a[i] == 0) continue;
        b[i] = fs[i] / a[i];
        c = min(c, b[i]);
    }
    int ans = max(0, c - mn);
    bool ok = c >= mn;
    for (int i = 0; i < 26; i++) {
        if (ft[i] > fs[i] - a[i] * c) {
            ok = 0;
        }
    }
    if (ok) ans++;
    cout << ans << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}