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 math

def solve():
    a = input()
    b = input()
    ara = []
    arb = []
    s = b
    if len(a) > len(b):
        b = a
        a = s

    for i in range(0, len(a) + 1):
        temp = set()
        ara.append(set())
        arb.append(temp)
    ara[0].add(' ')
    arb[0].add(' ')
    for i in range(0, len(a)):
        for leng in range(0, len(a) - i):
            temp3 = ''
            for ii in range(i, i + leng + 1):
                temp3 += a[ii]
            ara[leng+1].add(temp3)
    for i in range(0, len(b)):
        for leng in range(0, len(b) - i):
            if leng >= len(a):
                continue
            temp2 = ''
            for ii in range(i, i + leng + 1):
                temp2 += b[ii]
            arb[leng + 1].add(temp2)
    i = len(a)
    ##print(arb)
    while i >= 0:
        for j in ara[i]:
            if j in arb[i]:
                print(len(a) + len(b) - 2*i)
                return
        i -= 1



t = int(input())
while (t):
    solve()
    t -= 1
