#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
const int N = 3000 + 10, INF = 0x7ffffff;
int n, m, s, t, f[N][N][2];
char a[N], b[N];
int main() {
    freopen("dna.in", "r", stdin);
    freopen("dna.out", "w", stdout);
    scanf("%d\n", &t);
	int i,j;
    while(t--) {
        scanf("%s\n", a+1);
        scanf("%s\n", b+1);
        n = strlen(a+1);
        m = strlen(b+1);
        for(i=1; i<=n; i++)f[i][0][0] = 1, f[i][0][1] = 0;
        for(i=1; i<=m; i++)f[0][i][0] = f[0][i][1] = INF;
        f[0][0][0]=f[0][0][1]=0;
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++) 
			{
				if(a[i]!=b[j])f[i][j][0]=INF;
                else f[i][j][0]=min(f[i-1][j-1][0],f[i-1][j-1][1]+3);
                f[i][j][1]=min(f[i-1][j][0],f[i-1][j][1]);
            }
        s = min(f[n][m][0], f[n][m][1] + 1);
        if(s >= INF) s = -1;
        printf("%d\n", s);
    }
    return 0;
}