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
#include <bits/stdc++.h>
using namespace std;

int _;
string a, b, c;

string str(int l, int r) {
	string k = "";
	for(int i = l; i <= r; i++) {
		k += b[i];
	}
	return k;
}

bool isok(int pos) {
	for(int i = pos, j = 0; j < c.length(); i++, j++) {
		if(i == a.length()) return 0;
		if(a[i] != c[j]) return 0;
	}
	return 1;
}

bool check() {
	for(int i = 0; i < a.length(); i++) {
		if(a[i] == c[0]) {
			if(isok(i)) {
				return 1;
			}
		}
	}
	return 0;
}

int main() {
	scanf("%d", &_);
	while(_--) {
		cin >> a >> b;
		int ans = a.length() + b.length();
		for(int len = 1; len <= b.length(); len++) {
			int l = 0, r = l + len - 1;
			while(r < b.length()) {
				c = str(l, r);
//				cout << c << endl;
				if(check()) {
					ans = min(ans, (int)((a.length()-c.length())+(b.length()-c.length())));
				}
				l++, r++;
			}
		}
		
		printf("%d\n", ans);
	}
}