#include<bits/stdc++.h>
using namespace std;
int n,S,T;
int hd[100005],nxt[300005],c[300005],dy[300005],tot=1;
int cur[100005],l[100005];
void addedge(int u,int v,int w){
	nxt[++tot]=hd[u],hd[u]=tot;
	c[tot]=w,dy[tot]=v;
}
bool getc(){
	for(int i=1;i<=n;++i)l[i]=1e9,cur[i]=hd[i];
	l[S]=0;
	queue<int>q;
	q.emplace(S);
	while(q.size()){
		int x=q.front();
		q.pop();
		for(int i=hd[x];i;i=nxt[i]){
			if(!c[i])continue;
			int cu=dy[i];
			if(l[cu]>l[x]+1){
				l[cu]=l[x]+1;
				q.emplace(cu);
			}
		}
	}
	return l[T]<1e9;
}
long long ans;
int dinic(int x,int rl){
	if(x==T){
		ans+=rl;
		return rl;
	}
	int rr=rl;
	for(int i=cur[x];i;i=nxt[i]){
		cur[x]=i;
		if(!c[i])continue;
		int cu=dy[i];
		if(l[cu]!=l[x]+1)continue;
		int zz=dinic(cu,min(rr,c[i]));
		c[i]-=zz,c[i^1]+=zz;
		rr-=zz;
		if(!rr)break;
	}
	return rl-rr;
}
int u[1005],uu[1005],p[1005],pp[1005],d1[1005],d2[1005];
int main(){
	int TT;
	scanf("%d",&TT);
	int tt=0;
	while(TT--){
		++tt;
		int N,K;
		scanf("%d%d",&N,&K);
		for(int i=1;i<=K;++i)scanf("%d",&u[i]),uu[u[i]]=tt;
		for(int i=1;i<=N;++i)scanf("%d",&pp[i]);
		if(tt==26&&K>3){
			cout<<N<<" "<<K<<endl;
			for(int i=1;i<=K;++i)cout<<u[i]<<" ";
			cout<<endl;
			for(int i=1;i<=N;++i)cout<<pp[i]<<" ";
			cout<<endl;
		}
		n=1+N+N+1,S=1,T=n;
		for(int i=1;i<=n;++i)hd[i]=0;
		for(int i=1;i<=tot;++i)dy[i]=c[i]=nxt[i]=0;
		tot=1;
		for(int i=1;i<=N;++i)d1[i]=d2[i]=0;
		for(int i=1;i<=N;++i)if(uu[i]==tt){
			if(uu[i-1]!=tt){
				++d1[i];
			}else{
				addedge(1+i,1+N+i-1,1);addedge(1+N+i-1,1+i,0);
			}
		}
		for(int i=1;i<=N;++i)if(uu[pp[i]]==tt){
			int x=pp[i],y=pp[i-1];
			if(uu[y]!=tt){
				++d2[x];
			}else{
				addedge(1+y,1+N+x,1);addedge(1+N+x,1+y,0);
			}
		}
		for(int i=1;i<=N;++i)if(uu[i]==tt){
			int mm=1e9;
			addedge(S,1+i,d2[i]);addedge(1+i,S,0);
			addedge(1+i,1+N+i,mm);addedge(1+N+i,1+i,0);
			addedge(1+N+i,T,d1[i]);addedge(T,1+N+i,0);
		}
		ans=0;
		while(getc())dinic(S,INT_MAX);
		printf("%lld\n",ans);
	}
	return 0;
}