#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int N = 1e5 + 5; 
const int INF = 1e9; 

int n, m; 
char s[N], f[N]; 
int dp[N][105]; 

void solve(void) {
    cin >> s + 1 >> f + 1; n = strlen(s + 1); m = strlen(f + 1); 
    for (int i = 0; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            dp[i][j] = INF; 
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            if (f[j + 1] == s[i + 1])
                dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + 1); 
            else 
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1); 
    int ans = 1e9; 
    for (int i = 1; i <= n; ++i) ans = min(ans, dp[i][m]); 
    for (int i = 1; i <= n; ++i) if (dp[i][m] == ans) {
        for (int x = i - ans + 1; x <= i; ++x)
            cout << s[x]; 
        cout << "\n"; 
        return; 
    }
}

int main(void) {
    ios::sync_with_stdio(0); 
    int T = 1; cin >> T; 
    while (T--) solve();
    return 0;
}