#include<cstdio>
#include<cstring>
using namespace std;
int max(int a,int b){return a>b?a:b;}
int min(int a,int b){return a<b?a:b;}
int t,n,m,f[100010],g[100010],ans,i,x,a[100010];
int main()
{
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&m);
        memset(f,0,sizeof(f));
        memset(g,0,sizeof(g));
        for (i=1;i<=n;i++) {scanf("%d",&x);a[i]=x;f[x]=max(f[x],f[x-1]+1);}
        for (i=1;i<=m;i++) {scanf("%d",&x);g[x]=max(g[x],g[x-1]+1);}
        ans=0;
        for (i=1;i<=n;i++) ans=max(ans,min(f[a[i]],g[a[i]]));
        printf("%d\n",ans);
    }
}