#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define vec(...) vector<__VA_ARGS__>
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

vi get(string s){
	vi cnt(26);
	rep(i,sz(s)){
		cnt[s[i]-'a']+=1;
	}
	return cnt;
}

void slv(){
	string s,t;
	cin>>s>>t;
	const int n=sz(s);
	const int m=sz(t);

	auto cnt_s=get(s);
	auto cnt_t=get(t);
	int si=26;

	rep(i,si){
		if(cnt_s[i]<cnt_t[i]){
			print(0);
			return;
		}
	}

	int ans=0;
	rng(pat,1,m+1){
		int take=0;
		int k=m/pat;
		int pok=1;
		rep(i,si){
			int x=cnt_t[i]/k,c=cnt_t[i]%k;
			if(x<c) pok=0;
			take+=x;
		}
		// if(pat==2) print(take,k);
		if(take==pat){
			int now=1e9;
			rep(i,si){
				if(!cnt_t[i]) continue;
				int x=cnt_t[i]/k,c=cnt_t[i]%k;
				assert(x>0);
				now=min(now,(cnt_s[i]-cnt_t[i])/x);
			}
			now+=1;
			ans=max(ans,now);
		}
	}
	print(ans);
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	int t;
	cin>>t;
	rep(cs,t){
		slv();
	}
}