#include <cstdio>
#include <vector>
#include <algorithm>

#define PB push_back
#define sz(x) (int)(x).size()

using namespace std;

typedef vector < int > vi;

const int N = 1050;
const int INF = 0x3f3f3f3f;

int n, k, bold[N], p[N];

struct Dinic{
	struct Edge {
		int to, rev, c, oc;
		int flow() { return max(oc - c, 0); }
	};
	vi lvl, ptr, q;
	vector<vector<Edge>> adj;
	Dinic(int n) : lvl(n), ptr(n), q(n), adj(n) {}
	void add_edge(int a, int b, int c, int rcap) {
		adj[a].PB({b, sz(adj[b]), c, c});
		adj[b].PB({a, sz(adj[a]) - 1, rcap, rcap});
	}
	int dfs(int v, int t, int f) {
		if(v == t || !f) return f;
		for(int &i = ptr[v];i < sz(adj[v]);i++) {
			Edge &e = adj[v][i];
			if (lvl[e.to] == lvl[v] + 1)
				if(int p = dfs(e.to, t, min(f, e.c))) {
					e.c -= p, adj[e.to][e.rev].c += p;
					return p;
				}
		}
		return 0;
	}
	int calc(int s, int t) {
		int flow = 0; q[0] = s;
		for(int L = 0;L < 31;L++)
			do {
			lvl = ptr = vi(sz(q));
			int qi = 0, qe = lvl[s] = 1;
			while(qi < qe && !lvl[t]) {
				int v = q[qi++];
				for(Edge e : adj[v])
					if(!lvl[e.to] && e.c >> (30 - L))
						q[qe++] = e.to, lvl[e.to] = lvl[v] + 1;
			}
			while (int p = dfs(s, t, INF)) flow += p;
		} while(lvl[t]);
		return flow;
	}
};

void solve(){
	scanf("%d%d", &n, &k);
	Dinic F(n + 2);
	for(int i = 1;i <= n;i++) bold[i] = 0;
	for(int i = 0;i < k;i++) {
		int x; scanf("%d", &x);
		bold[x] = 1;
	}
	for(int i = 1;i <= n;i++) {
		scanf("%d", p + i);
	}
	if(bold[1]) F.add_edge(0, 1, 1, 1);
	if(bold[n]) F.add_edge(0, n, 1, 1);
	for(int i = 1;i <= n;i++) {
		if(bold[i] && bold[i + 1]) F.add_edge(i, i + 1, 1, 1);
		else if(bold[i]) F.add_edge(i, 0, 1, 1);
		else if(bold[i + 1]) F.add_edge(i + 1, 0, 1, 1);
	}
	if(bold[p[1]]) F.add_edge(n + 1, p[1], 1, 1);
	if(bold[p[n]]) F.add_edge(n + 1, p[n], 1, 1);
	for(int i = 1;i <= n;i++) {
		if(bold[p[i]] && bold[p[i + 1]]) F.add_edge(p[i], p[i + 1], 1, 1);
		else if(bold[p[i]]) F.add_edge(p[i], n + 1, 1, 1);
		else if(bold[p[i + 1]]) F.add_edge(p[i + 1], n + 1, 1, 1);
	}
	printf("%d\n", F.calc(0, n + 1) / 2);
}

int main(){
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}