#include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #include<cmath>

 using namespace std;

 const int maxn=;

 const double eps=1e-;

 const int modn=;

 int n,m;

 int f1[*maxn]={};

 int f2[*maxn]={};

 int main(){

     int T;scanf("%d",&T);

     while(T-->){

         scanf("%d%d",&n,&m);

         memset(f1,,sizeof(f1));

         memset(f2,,sizeof(f2));

         int x,ma=,ans=,z;

         for(int i=;i<=n;i++){

             scanf("%d",&x);

             f1[x]=f1[x-]+;

             ma=max(x,ma);

         }

         for(int i=;i<=m;i++){

             scanf("%d",&x);

             f2[x]=f2[x-]+;

             ma=max(x,ma);

         }

         for(int i=;i<=ma;i++){

             z=min(f1[i],f2[i]);

             ans=max(ans,z);

         }

         printf("%d\n",ans);

     }

     return ;

 }