#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
typedef long long LL;
using namespace std;
const int maxn = 5000+5;int dp[maxn][maxn];  // dp(i,j) p中取i个, q中取j个的最小代价
char p[maxn];
char q[maxn];
int c[maxn][maxn]; // c(i,j) p中取i个, q中取j个已经开始还没有结束字符的个数
int sp[30], sq[30], ep[30], eq[30];
const int INF = 0x3fffffff;int main() {int t;scanf( "%d", &t );while( t-- ) {
//        scanf( "%s", p+1);
//        scanf( "%s", q+1);scanf("%s%s", p + 1, q + 1);int n = (int)strlen(p+1);int m = (int)strlen(q+1);memset(c, 0, sizeof(c));memset(dp, 0, sizeof(dp));for( int i = 1; i <= n; i++ ) p[i] -= 65;for( int j = 1; j <= m; j++ ) q[j] -= 65;for( int i = 0; i < 26; i++ ) {sp[i] = sq[i] = INF;ep[i] = eq[i] = 0;}for( int i = 1; i <= n; i++ ) {sp[p[i]] = min( sp[p[i]], i );ep[p[i]] = i;}for( int i = 1; i <= m; i++ ) {sq[q[i]] = min( sq[q[i]], i );eq[q[i]] = i;}for( int i = 0; i <= n; i++ ) {for( int j = 0; j <= m; j++ ) {if( !i && !j ) continue;int v1, v2;v1 = v2 = INF;if( i ) v1 = dp[i-1][j] + c[i-1][j];if( j ) v2 = dp[i][j-1] + c[i][j-1];dp[i][j] = min( v1, v2 );if( i ) {c[i][j] = c[i-1][j];
//                    if( sp[p[i]] == i && (ep[p[i]] > i || eq[p[i]] > j ) ) c[i][j]++;
//                    if( ep[p[i]] == i && eq[p[i]] <= j ) c[i][j]--;if (sp[p[i]] == i && sq[p[i]] > j)  c[i][j]++;if (ep[p[i]] == i && eq[p[i]] <= j) c[i][j]--;}else if( j ) {c[i][j] = c[i][j-1];
//                    if( sq[q[j]] == j && (eq[q[j]] > j || ep[q[j]] > i ) ) c[i][j]++;
//                    if( eq[q[j]] == j && ep[q[j]] <= i ) c[i][j]--;if (sq[q[j]] == j && sp[q[j]] > i)  c[i][j]++;if (eq[q[j]] == j && ep[q[j]] <= i) c[i][j]--;}}}printf( "%d\n", dp[n][m] );}return 0;
}