#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mxn=1e5+5;
char s[mxn],s2[mxn],f[mxn];
int nxt[mxn][26+10];
int main()
{
	int T=read();
	while(T--)
	{
		int i,j,mn=1e9,l,r;
		scanf("%s%s",s+1,f+1);
		int n=strlen(s+1),m=strlen(f+1);
		for(i=1;i<=n;i++)
			s2[i]=s[i];
		for(i=1;i<=n;i++)
			s[i]=s[i]>='a'&&s[i]<='z'?s[i]-'a':s[i]-'0'+26;
		for(i=1;i<=m;i++)
			f[i]=f[i]>='a'&&f[i]<='z'?f[i]-'a':f[i]-'0'+26;
		for(i=0;i<26+10;i++)
			nxt[n+1][i]=n+1;
		for(i=n;i;i--)
		{
			memcpy(nxt[i],nxt[i+1],sizeof(nxt[i]));
			if(i<=n)
				nxt[i][s[i+1]]=i+1;
		}
		for(i=1;i<=n;i++)
			if(f[1]==s[i])
			{
				int w=i;
				for(j=2;j<=m;j++)
					w=nxt[w][f[j]];
				if(w<=n) mn=min(mn,w-i+1),l=i,r=w;
			}
		for(;l<=r;l++)
			putchar(s2[l]);
		puts("");
	}
}