#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <bitset>

#define rep(i, l, r) for(int i=l; i<=r; i++)
#define dow(i, l, r) for(int i=l; i>=r; i--)
#define clr(x, c) memset(x, c, sizeof(x))
#define travel(x) for(edge *p=fir[x]; p; p=p->n)
#define all(x) (x).begin,(x).end
#define pb push_back
#define fi first
#define se second
#define l(x) Left[x]
#define r(x) Right[x]
#define lowbit(x) (x&-x)

using namespace std;

typedef long long ll;
typedef pair<int,int> Pii;
typedef long double ld;
typedef unsigned long long ull;

inline int read()
{
    int x=0; bool f=0; char ch=getchar();
    while (ch<'0' || '9'<ch) f|=ch=='-', ch=getchar();
    while ('0'<=ch && ch<='9') x=x*10+ch-'0', ch=getchar();
    return f?-x:x;
}

#define maxn 2000009

int A[maxn], B[maxn], k[maxn];

int main()
{
    int t=read(); while (t--)
    {
        int n=read(), m=read(), tot=0;
        rep(i, 1, n)
        {
            int x=read(); k[++tot]=x;
            A[x]=max(A[x], A[x-1]+1);
        }
        rep(i, 1, m)
        {
            int x=read(); k[++tot]=x;
            B[x]=max(B[x], B[x-1]+1);
        }
        int Ans=0;
        rep(i, 1, tot) Ans=max(Ans, min(A[k[i]],B[k[i]])), A[k[i]]=B[k[i]]=0;
        printf("%d\n", Ans);
    }
    return 0;
}