#include<stdio.h>
#include <limits>
using namespace std;
int n,m;
long long a[105],b[105];
int cache[105][105]={0,};
const long long NEGINF = numeric_limits<long long>::min();
int count(int x,int y)
{
    if(cache[x][y]!=0) return cache[x][y];
    int max=2;
    long long  bigger = a[x]>b[y] ? a[x]:b[y];
    for(int i=x+1;i<=n;i++)
    {
        if(a[i]>bigger)
        {
            int temp=count(i,y);
            if(temp+1>max) max=temp+1;
        }
    }
    for(int j=y+1;j<=m;j++)
    {
        if(b[j]>bigger)
        {
            int temp=count(x,j);
            if(temp+1>max) max=temp+1;
        }
    }
    cache[x][y]=max;
    return max;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&n,&m);
        int i,j;
        a[0]=NEGINF;
        b[0]=NEGINF;
        for(i=1;i<=n;i++) scanf("%d",&a[i]);
        for(i=1;i<=m;i++) scanf("%d",&b[i]);
        int answer=0;
        answer=count(0,0);
        printf("%d\n",answer-2);
        for(i=0;i<=104;i++)
            for(j=0;j<=104;j++) cache[i][j]=0;
    }
    return 0;
}