CF1506C.Double-ended Strings

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| \gt 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 \ldots a_n$;
• if $|a| \gt 0$, delete the last character of the string $a$, that is, replace $a$ with $a_1 a_2 \ldots a_{n-1}$;
• if $|b| \gt 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 \ldots b_n$;
• if $|b| \gt 0$, delete the last character of the string $b$, that is, replace $b$ with $b_1 b_2 \ldots 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$ $\Rightarrow$ $a=$"ello" and $b=$"icpc";
• delete the first character of the string $b$ $\Rightarrow$ $a=$"ello" and $b=$"cpc";
• delete the first character of the string $b$ $\Rightarrow$ $a=$"ello" and $b=$"pc";
• delete the last character of the string $a$ $\Rightarrow$ $a=$"ell" and $b=$"pc";
• delete the last character of the string $b$ $\Rightarrow$ $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.

给你两个由小写拉丁字母组成的字符串 $a$ 和 $b$。你可以以任意顺序执行以下任意次数的操作：

• 若 $|a| \gt 0$（字符串 $a$ 的长度大于零），则删除字符串 $a$ 的第一个字符，即用 $a_2 a_3 \ldots a_n$ 替换 $a$；
• 若 $|a| \gt 0$，则删除字符串 $a$ 的最后一个字符，即用 $a_1 a_2 \ldots a_{n-1}$ 替换 $a$；
• 若 $|b| \gt 0$（字符串 $b$ 的长度大于零），则删除字符串 $b$ 的第一个字符，即用 $b_2 b_3 \ldots b_n$ 替换 $b$；
• 若 $|b| \gt 0$，则删除字符串 $b$ 的最后一个字符，即用 $b_1 b_2 \ldots b_{n-1}$ 替换 $b$。

注意：每次操作后，字符串 $a$ 或 $b$ 可能变为空。

例如，若 $a=$"hello" 且 $b=$"icpc"，则你可以执行如下操作序列：

• 删除字符串 $a$ 的第一个字符 $\Rightarrow$ $a=$"ello"，$b=$"icpc"；
• 删除字符串 $b$ 的第一个字符 $\Rightarrow$ $a=$"ello"，$b=$"cpc"；
• 删除字符串 $b$ 的第一个字符 $\Rightarrow$ $a=$"ello"，$b=$"pc"；
• 删除字符串 $a$ 的最后一个字符 $\Rightarrow$ $a=$"ell"，$b=$"pc"；
• 删除字符串 $b$ 的最后一个字符 $\Rightarrow$ $a=$"ell"，$b=$"p"。

对于给定的字符串 $a$ 和 $b$，求使字符串 $a$ 和 $b$ 相等所需的最少操作次数。注意：空字符串也被视为相等。

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

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

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

第一行包含一个整数 $t$（$1 \le t \le 100$）。随后是 $t$ 组测试数据。

每组测试数据的第一行包含字符串 $a$（$1 \le |a| \le 20$），由小写拉丁字母组成。

每组测试数据的第二行包含字符串 $b$（$1 \le |b| \le 20$），由小写拉丁字母组成。

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

对于每个测试用例，输出使字符串 $a$ 和 $b$ 相等所需的最少操作次数。