#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b)  for(ll i=a;i<b;i++)
#define nl cout<<endl

#define pii pair<ll,ll>
#define vi  vector<ll>
#define vii vector<pii>
#define mi  map<ll,ll>
#define all(a)  (a).begin(),(a).end()

#define pb push_back
#define ff first
#define ss second
#define hell 1000000007

#define test4(x,y,z,a) cout<<"x is "<<x<<"		y is "<<y<<"		z is "<<z<<"		a is "<<a<<endl;
#define test3(x,y,z) cout<<"x is "<<x<<"		y is "<<y<<"		z is "<<z<<endl;
#define test2(x,y) cout<<"x is "<<x<<"		y is "<<y<<endl;
#define test1(x) cout<<"x is "<<x<<endl;
#define N 300009

ll power(ll a,ll b,ll m)
{
	ll ans=1;
	while(b)
	{
		if(b&1)
			ans=(ans*a)%m;
		b/=2;
		a=(a*a)%m;
	}
	return ans;
}
int main()
{	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
        
	ll t;cin>>t;
	while(t--)
	{
		string r,s;cin>>s>>r;
		ll n=s.length();

		vi v;
		rep(i,0,n)
		if(s[i]!=r[i])
		v.pb(i);

		if(v.size()<=1)
		{
			cout<<v.size()<<endl;
			continue;
		}
		ll ans=v[v.size()-1]-v[0]+1;
		//test2("ans",ans);
		ll st=v[0];ll fin=v[v.size()-1];

		ll cnt=0;
		v.clear();
		for(ll i=st+1;i<fin;i++)
		{
			if(s[i]==r[i])
			cnt++;
			else
			{
				v.pb(cnt);
				cnt=0;
			}
		}
		if(cnt)
		v.pb(cnt);	
		sort(all(v));
		reverse(all(v));	
		ll sum=0;
		rep(i,0,v.size())
		{
			sum+=v[i];
			ans=min(ans,(ans-sum)*(i+2));
		}
		cout<<ans<<endl;
	}
}