#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=100+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,f[N][40];char s[N],t[N],ts[N];
int trans(int x){if(x>='a'&&x<='z') return x-'a';return x-'0'+26;}
void Solve(){
	int i,j;
	scanf("%s%s",s+1,t+1);n=strlen(s+1);m=strlen(t+1);
	for(i=1;i<=n;i++) ts[i]=s[i],s[i]=trans(s[i]);for(i=1;i<=m;i++) t[i]=trans(t[i]);
	pii ans=make_pair(-INF,INF);
	for(i=1;i<=n;i++) Mc(f[i],f[i-1]),f[i][s[i]]=i;
	for(i=1;i<=n;i++){
		int x=i,flag=0;
		for(j=m;j;j--) {
			if(!f[x][t[j]]) {flag=1;break;}
			x=f[x][t[j]]-1;
		}
		if(!flag&&ans.se-ans.fi+1>i-x) ans=make_pair(x+1,i); 
	}
	// cerr<<ans.se<<' '<<ans.fi<<'\n';
	for(i=ans.fi;i<=ans.se;i++) printf("%c",ts[i]);printf("\n");
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}