//#define _GLIBCXX_DEBUG

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>



using namespace std;



#define rep(i,n) for (int i=0;i<n;i+=1)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<"\n";
}

template<class T>
ostream& operator<<(ostream& os, const vec<T>& A){
  os << "{";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "}" ;
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const deque<T>& A){
  os << "deque{[";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "]}" ;
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const pair<T,T>& A){
  os << "(";
  os << A.first ;
  os << ", ";
  os << A.second;
  os << ")";
  return os;
}

const int K = 26;

int solve(){
  string S,T;
  cin>>S>>T;

  int N = T.size();

  vec<int> cnt_S(K,0),cnt_T(K,0);
  for (auto s:S){
    cnt_S[s-'a']++;
  }
  for (auto t:T){
    cnt_T[t-'a']++;
  }
  rep(i,K){
    if (cnt_S[i] < cnt_T[i]){
      return 0;
    }
    cnt_S[i] -= cnt_T[i];
  }

  auto cond = [&](int x){
    assert (x!=0);
    for (int k=1;k<=N;k++){
      int mini = 0,maxi = 0;
      int q = N/k;
      rep(i,26){
        if (cnt_T[i]==0){
          continue;
        }
        /*
        cnt_T[i]-qm >= 0
        -cnt_T[i] + (q+1)m >= 0
        cnt_S[i]/m >= x
        */
       int L = (cnt_T[i]+q)/(q+1);
       int R = min(cnt_T[i]/q,cnt_S[i]/x);

       //cout << x << " " << L << " " << R << endl;

       if (R < L){
        mini = 0;
        maxi = -1;
        break;
       }

       mini += L; maxi += R;
      }
      if (mini <= k && k <= maxi){
        return true;
      }
    }
    return false;
  };

  int ok = 0;
  int ng = S.size();
  while (ng-ok>1){
    int mid = (ok+ng)>>1;
    if (cond(mid)){
      ok = mid;
    }
    else{
      ng = mid;
    }
  }

  return 1 + ok;
  
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin>>T;
    while (T--){
      auto res = solve();
      cout << res << endl;
    }

        

}