#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  string s, t;
  scan(s, t);
  array<int, 26> a{};
  for (char c : s) {
    ++a[c - 'a'];
  }
  array<int, 26> b{};
  for (char c : t) {
    ++b[c - 'a'];
  }
  int n = len(s);
  int m = len(t);

  auto check = [&](int mid) -> bool {
    vector<int64_t> memo(m + 1, -1);
    for (int k : rep1(m)) {
      int qb = m / k;
      if (memo[qb] == -1) {
        int qa = qb + (mid - 1);
        bool ok = true;
        int64_t sum_c1 = 0;
        for (int i : rep(26)) {
          int64_t c1 = b[i] % qb;
          if (b[i] < int64_t(qb + 1) * c1) {
            ok = false;
            break;
          }
          int64_t c0 = (b[i] - int64_t(qb + 1) * c1) / qb;
          if (a[i] < int64_t(qa) * c0 + int64_t(qa + 1) * c1) {
            int64_t d = int64_t(qa) * c0 + int64_t(qa + 1) * c1 - a[i];
            if (qa == qb) {
              ok = false;
              break;
            }
            int e = qa - qb;
            int delta = (d + e - 1) / e;
            c0 -= delta * int64_t(qb + 1);
            c1 += delta * int64_t(qb);
          }
          if (c0 < 0 || c1 < 0) {
            ok = false;
            break;
          }
          sum_c1 += c1;
        }
        if (!ok) {
          continue;
        }
        memo[qb] = sum_c1;
      }
      int64_t sum_c1 = memo[qb];
      int r = m % k;
      if (r < sum_c1) {
        continue;
      }
      int d = r - sum_c1;
      if (d % qb) {
        continue;
      }
      return true;
    }
    return false;
  };

  int ok = 0;
  int ng = n + 1;
  while (ok + 1 < ng) {
    int mid = midpoint(ok, ng);
    (check(mid) ? ok : ng) = mid;
  }

  print(ok);
}

}  // namespace

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

  int t;
  scan(t);
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

using namespace std;

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = forward<U>(y), true);
}

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

template <class... Ts>
void scan(Ts&&... xs) {
  (cin >> ... >> xs);
}

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

inline auto len = ranges::ssize;

#endif  // __INCLUDE_LEVEL__