//
//  main.cpp
//  bc87-1003
//
//  Created by Candy on 10/1/16.
//  Copyright © 2016 Candy. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
using namespace std;
const int N=1e5+5,V=1e6+5;
inline int read(){
    char c=getchar();int x=0,f=1;
    while(c<‘0‘||c>‘9‘){if(c==‘-‘)f=-1;c=getchar();}
    while(c>=‘0‘&&c<=‘9‘){x=x*10+c-‘0‘;c=getchar();}
    return x;
}
int T,n,m,a[N],b[N],f[V],g[V];
int main(int argc, const char * argv[]){
    T=read();
    while(T--){
        n=read();m=read();
        int ans=0,la=0,lb=0;
        for(int i=1;i<=n;i++) a[i]=read();//la=max(la,a[i]=read());
        for(int i=1;i<=m;i++) b[i]=read();//lb=max(lb,b[i]=read());
        for(int i=1;i<=n;i++)
            f[a[i]]=max(f[a[i]],f[a[i]-1]+1);
        for(int i=1;i<=m;i++){
            g[b[i]]=max(g[b[i]],g[b[i]-1]+1);
            ans=max(ans,min(f[b[i]],g[b[i]]));
        }
        printf("%d\n",ans);//la++;lb++;
        //memset(f,0,la*sizeof(int));
        //memset(g,0,lb*sizeof(int));
        for(int i=1;i<=n;i++) f[a[i]]=0;
        for(int i=1;i<=m;i++) g[b[i]]=0;
    }
    return 0;
}