You are given the strings a and b, consisting of lowercase Latin letters. You can do any number of the following operations in any order: 

  * if |a| > 0 (the length of the string a is greater than zero), delete the first character of the string a, that is, replace a with a_2 a_3 … a_n; 
  * if |a| > 0, delete the last character of the string a, that is, replace a with a_1 a_2 … a_{n-1}; 
  * if |b| > 0 (the length of the string b is greater than zero), delete the first character of the string b, that is, replace b with b_2 b_3 … b_n; 
  * if |b| > 0, delete the last character of the string b, that is, replace b with b_1 b_2 … b_{n-1}. 



Note that after each of the operations, the string a or b may become empty.

For example, if a="hello" and b="icpc", then you can apply the following sequence of operations: 

  * delete the first character of the string a ⇒ a="ello" and b="icpc"; 
  * delete the first character of the string b ⇒ a="ello" and b="cpc"; 
  * delete the first character of the string b ⇒ a="ello" and b="pc"; 
  * delete the last character of the string a ⇒ a="ell" and b="pc"; 
  * delete the last character of the string b ⇒ a="ell" and b="p". 



For the given strings a and b, find the minimum number of operations for which you can make the strings a and b equal. Note that empty strings are also equal.

Input

The first line contains a single integer t (1 ≤ t ≤ 100). Then t test cases follow.

The first line of each test case contains the string a (1 ≤ |a| ≤ 20), consisting of lowercase Latin letters.

The second line of each test case contains the string b (1 ≤ |b| ≤ 20), consisting of lowercase Latin letters.

Output

For each test case, output the minimum number of operations that can make the strings a and b equal.

Example

Input


5
a
a
abcd
bc
hello
codeforces
hello
helo
dhjakjsnasjhfksafasd
adjsnasjhfksvdafdser


Output


0
2
13
3
20
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class drt
{
    public static void main(String[] args) throws IOException {
        InputStreamReader r=new InputStreamReader(System.in);
        BufferedReader br=new BufferedReader(r);
        int a=Integer.parseInt(br.readLine());
        int arr[]=new int[a];
        for(int i=0;i<a;i++)
        {
            String s1=br.readLine();
            String s2=br.readLine();
            int l1=s1.length();
            int l2=s2.length();
            int arr1[][]=new int[l1][l2];
            int b=0;
            for(int j=0;j<l1;j++)
            {
                for(int k=0;k<l2;k++)
                {
                    if(s1.charAt(j)==s2.charAt(k))
                    {
                        if(j==0||k==0)
                        {
                            arr1[j][k]=1;
                        }
                        else
                        {
                            arr1[j][k]=1+arr1[j-1][k-1];
                        }
                    }
                    if(b<arr1[j][k])
                    {
                        b=arr1[j][k];
                    }
                }
            }
            int l=l1+l2-2*b;
            arr[i]=l;
        }
        for(int i=0;i<a;i++)
        {
            System.out.println(arr[i]);
        }
    }
}