#include<cstdio>
#include<algorithm>
using namespace std;
struct ss{int whi,num;}s[200005];
int n,m,sr,lsh[200005],tre[200005],cnt,t,ans;
bool c(ss a,ss b){return a.num<b.num||a.num==b.num&&a.whi<b.whi;}
int lshs(int num){return lower_bound(lsh+1,lsh+cnt+1,num)-lsh;}
void add(int wh){while(wh<=cnt) tre[wh]++,wh+=wh&(-wh);}
int ask(int a,int b){int rts=0;while(b) rts+=tre[b],b-=b&(-b);
while(a) rts-=tre[a],a-=a&(-a);return rts;}
int main()
{
    scanf("%d",&t);while(t--)
    {
        scanf("%d%d",&n,&m),ans=0;
        for(int i=1;i<=n;i++) scanf("%d",&s[i].num),s[i].whi=1;
        for(int i=1;i<=m;i++) scanf("%d",&s[i+n].num),s[i+n].whi=0;
        s[n+m+1]={0,(int)1e9+1},sort(s+1,s+n+m+1,c);
        for(int i=1;i<=n+m+1;i++) lsh[i]=s[i].num,tre[i]=0;
        cnt=unique(lsh+1,lsh+n+m+2)-lsh-1;int lst=0;bool finde=0;
        for(int i=1;i<=n+m+1;i++)
        {
            if(s[i].whi) add(lshs(s[i].num));
            else ans=max(ans,ask(lst,lshs(s[i].num))),lst=lshs(s[i].num);
        }printf("%d\n",ans);
    }
}