#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T;
	cin>>T;
	while(T--){
		string A,B;
		cin>>A>>B;
		int N=A.size(),M=B.size();
		int dp[N+1][M+1],l[N+1][M+1],a[N+1][M+1],b[N+1][M+1];
		memset(dp,0,sizeof(dp));
		memset(l,0,sizeof(l));
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(int i=1;i<=N;i++){
			for(int j=1;j<=M;j++){
				l[i][j]=i+j-1-min(i==1?j:dp[i-1][j],j==1?i:dp[i][j-1]);
				l[i][j]=max(l[i][j],max(l[i-1][j],l[i][j-1]));
				a[i][j]=i+j-1-(i==1?j:dp[i-1][j]);
				b[i][j]=i+j-1-(j==1?i:dp[i][j-1]);
				dp[i][j]=i+j+3-l[i][j];
				int k=0;
				while(k<i&&k<j&&A[i-k-1]==B[j-k-1]){
					k++;
					dp[i][j]=min(dp[i][j],dp[i-k][j-k]+k);
				}
				// cout<<setw(4)<<i<<' '<<j<<' '<<dp[i][j]<<' '<<l[i][j]<<'\n';
			}
		}
		cout<<dp[N][M]<<'\n';
	}
	return 0;
}