#include<bits/stdc++.h>
using namespace std;
int sbac[30], tbac[30];
void solve() {
    string s, t;
    cin >> s >> t;
    int n = s.length(), m = t.length();
    for (int i = 0; i < n; ++i) sbac[s[i] - 'a']++;
    for (int i = 0; i < m; ++i) tbac[t[i] - 'a']++;
    bool flag = 1;
    string one = "", two = "", thr = "";
    for (int i = 0; i < 26; ++i) {
        char ch = 'a' + i;
        if (tbac[i] % 3 == 1) {
            flag = 0;
            break;
        } if (tbac[i] % 3 == 2)
            two = two + ch;
        while (tbac[i] >= 3) {
            tbac[i] -= 3;
            thr = thr + ch;
        }
    }
    int border = 0;
    int cir = 0;
    for (int len = 1; len <= m / 3; ++len) {
        if (m % len) continue;
        int k = m / len;
        bool flag = 1;
        for (int i = 0; i < 26; ++i) {
            if (tbac[i] % k) {
                flag = 0;
                break;
            }
        }
        if (flag) {
            cir = len;
            break;
        }
    }
    if (cir) {
        string c = "";
        int k = m / cir;
        for (int i = 0; i < 26; ++i) {
            char ch = 'a' + i;
            while (tbac[i] >= k) {
                c = c + ch;
                tbac[i] -= k;
            }
        }
        t = "";
        for (int i = 0; i < k; ++i)
            t = t + c;
        border = m - cir;
    } else if (!flag) {
        two = "";
        for (int i = 0; i < 26; ++i) {
        char ch = 'a' + i;
            if (tbac[i] & 1) one = one + ch;
            while (tbac[i] >= 2) {
                tbac[i] -= 2;
                two = two + ch;
            }
        }
        t = two + one + two;
        border = two.length();
    } else t = thr + two + thr + two + thr, border = thr.length() * 2 + two.length();
    // cout << t << " " << border << endl;
    int now = 0, ans = 0;
    for (int i = 0; i < n; ++i) {
        if (sbac[t[now] - 'a']) {
            sbac[t[now] - 'a']--;
            if (now == m - 1) ans++, now = border;
            else now++;
        } else break;
    }
    cout << ans << endl;
    for (int i = 0; i < 26; ++i) sbac[i] = tbac[i] = 0;
}
int main() {
    cin.tie(nullptr) -> ios::sync_with_stdio(false);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}
/*
1
bajkaaaabbbb aaaabbbb
*/