import java.util.*;
class StringPresentTryingAllCombinationsOfB {

    static int p = -1;
    // p is first 
    static boolean isSubsequence(String A, String B) {
        int n = A.length();
        int m = B.length();

        int i = 0, j = 0, count = 0;

        while(i<n && j<m){
        	// increment i when i get a match with char in s string
            // cant go ahead if no match .. order matters too so first char of g 
            // must come before the 2nd char of g in s
            if(A.charAt(i)==B.charAt(j)){
                if(count==0){
                    p = j;
                }
                j++;
                count++;
            }
            i++;
        }

        return count == m;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int t = sc.nextInt();

        while (t-- > 0) {

            String a = sc.next();
            String b = sc.next();

            int answer = -1;

            for (int i = 1; i < b.length(); i++) {

                for(char c = 'a'; c <= 'z'; c++){
                    char[] arr = b.toCharArray();
                    arr[i] = c;
                    String r = new String(arr);
                    p = -1;
                    if(isSubsequence(a,r)){
                        // print in 1 based indexing
                        answer = p + 1;
                    }
                }
            }

            System.out.println(answer);
        }

        sc.close();
    }
}