#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
const int N = 3000 + 10;
int n, m, j, k, e, s, l1, l2;
char s1[N], s2[N];
vector<int> b;
int main() {
    freopen("dna.in", "r", stdin);
    freopen("dna.out", "w", stdout);
    scanf("%d\n", &n);
    while(n--) {
        scanf("%s\n", s1);
        scanf("%s\n", s2);
        l1 = strlen(s1);
        l2 = strlen(s2);
        e = 0;
        s = l1 * 3;
        if(l1 < l2) s = -1;
        while(e + l2 <= l1) {
            m = j = k = 0;
            b.clear();
            for(int i=e; i<l1 && j<l2; i++)
                if(s1[i] == s2[j])
                    b.push_back(i), j++;
                else if(j && s1[i] == s2[j-1])
                    b.push_back(i);
            k = b.size();
            /*for(int j=0; j<k; j++)
                fprintf(stderr, "%d ", b[j]);
            fprintf(stderr, "(%d) [%d]\n", k, e);*/
            if(k < l2) {
                if(!e) s = -1;
                break;
            } else {
                if(b[0] != 0) m++;
                if(b[k-1] != l1-1) m++;
                for(int i=1; i<k; i++)
                    m += (b[i] - b[i-1] > 1) * 3;
            }
            e = b[0] + 1;
            s = min(s, m);
        }
        printf("%d\n", s);
    }
    return 0;
}