#include<iostream>

#define MAX 101

using namespace std;

int a[MAX],b[MAX];
int cache[MAX][MAX];
int n,m;


int maxlength(int weight, int aa,int bb)
{
    if(aa==n && bb==m) return 1;
    int& ret=cache[aa][bb];

    if(ret!=-1) return ret;

    int i,j;
    int max=0;

    for(i=aa;i<n;i++)
    {
        int k;
        if(weight<a[i]) k=maxlength(a[i],i+1,bb);
        if(weight<a[i] && max<k)
            max=k;
    }

    for(i=bb;i<m;i++)
    {
        int k;
        if(weight<b[i]) k=maxlength(b[i],aa,i+1);
        if(weight<b[i] && max<k)
            max=k;
    }

    return ret=max+1;

}
int main( )
{
    int T;

    for(cin >> T;T--;){
        int i,j;
        cin >> n >> m;

        for(i=0;i<n;i++) cin >> a[i];
        for(i=0;i<m;i++) cin >> b[i];

        for(i=0;i<=n;i++){
            for(j=0;j<=m;j++)
                cache[i][j]=-1;
        }

        int aaa=0;
        int bbb=0;

        for(i=0;i<n;i++) if(aaa< maxlength(a[i],i+1,0)) aaa=maxlength(a[i],i+1,0);
        for(i=0;i<n;i++) if(bbb< maxlength(b[i],0,i+1)) bbb=maxlength(b[i],0,i+1);

        if(aaa<bbb) printf("%d\n",bbb);
        else printf("%d\n",aaa);
    }
    return 0;
}