#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")


int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        string S,T;cin>>S>>T;
        vector<ll> cnS(26),cnT(26);
        for(char c:S) cnS[c-'a']++;
        for(char c:T) cnT[c-'a']++;
        bool f=true;
        for(int i=0;i<26;i++){
            if(cnS[i]<cnT[i]) f=false;
            cnS[i]-=cnT[i];
        }
        if(!f){
            cout<<0<<"\n";
            continue;
        }
        
        ll ans=0;
        
        for(int k=1;k<=si(T);k++){
            ll need=(si(T)+k-1)/k;
            ll sum=0;
            for(int i=0;i<26;i++){
                sum+=(cnT[i]+need-1)/need*need;
            }
            if(sum!=need*k) continue;
            
            ll mi=1LL<<60;
            for(int i=0;i<26;i++){
                if(cnT[i]) chmin(mi,(cnS[i])/((cnT[i]+need-1)/need));
            }
            
            chmax(ans,mi);
        }
        
        cout<<ans+1<<"\n";
    }
}