#include<iostream>
#include<queue>
#include<vector>
#include<cassert>
using namespace std;
int N,K;
int T[2<<17],A[2<<17],deg[2<<17];
vector<int>G[2<<17];
vector<int>L[2<<17],P[2<<17];
bool vis[2<<17];
vector<int>loop;
int V[2<<17];
void dfs(int u,int idx,int i,long long dist,int ans)
{
	dist++;
	int a=T[u];
	P[a].push_back(idx);
	long long nd;
	if(P[a].size()>=K)nd=P[a][P[a].size()-K]-idx;
	else if(!L[a].empty())
	{
		int k=K-P[a].size();
		int l=lower_bound(L[a].begin(),L[a].end(),i)-L[a].begin();
		int q=(k-1)/L[a].size();
		int r=(k-1)%L[a].size();
		nd=-idx;
		nd+=(long long)q*loop.size();
		if(l+r<L[a].size())nd+=L[a][l+r]-i;
		else nd+=L[a][l+r-L[a].size()]-i+(int)loop.size();
		if(dist>nd)dist=nd,ans=a;
	}
	V[u]=ans;
	for(int v:G[u])dfs(v,idx-1,i,dist,ans);
	assert(P[a].back()==idx);
	P[a].pop_back();
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int TTT;cin>>TTT;
	for(;TTT--;)
	{
		cin>>N>>K;
		for(int i=0;i<N;i++)cin>>T[i],T[i]--;
		for(int i=0;i<N;i++)cin>>A[i],A[i]--;
		{
			for(int i=0;i<N;i++)
			{
				G[i].clear();
				deg[i]=0;
				vis[i]=false;
			}
			for(int i=0;i<N;i++)deg[A[i]]++;
			queue<int>Q;
			for(int i=0;i<N;i++)if(!deg[i])Q.push(i);
			while(!Q.empty())
			{
				int u=Q.front();Q.pop();
				G[A[u]].push_back(u);
				vis[u]=true;
				if(!--deg[A[u]])Q.push(A[u]);
			}
		}
		for(int i=0;i<N;i++)if(!vis[i])
		{
			int u=i;
			loop.clear();
			while(!vis[u])
			{
				loop.push_back(u);
				vis[u]=true;
				u=A[u];
			}
			for(int i=0;i<loop.size();i++)L[T[loop[i]]].push_back(i);
			long long dist=1e18;
			int ans;
			for(int i=0;i<loop.size();i++)
			{
				int a=T[loop[i]];
				int q=(K-1)/L[a].size();
				int r=(K-1)%L[a].size();
				long long nd=(long long)q*loop.size();
				nd+=L[a][r];
				if(dist>nd)dist=nd,ans=a;
			}
			long long _dist=dist;
			for(int i=loop.size();i--;)
			{
				dist++;
				int a=T[loop[i]];
				int q=(K-1)/L[a].size();
				int r=(K-1)%L[a].size();
				long long nd=(long long)q*loop.size();
				int pos=lower_bound(L[a].begin(),L[a].end(),i)-L[a].begin();
				assert(L[a].at(pos)==i);
				if(pos+r<L[a].size())nd+=L[a][pos+r]-i;
				else nd+=L[a][pos+r-L[a].size()]-i+(int)loop.size();
				if(dist>nd)dist=nd,ans=a;
				V[loop[i]]=ans;
				for(int u:G[loop[i]])dfs(u,-1,i,dist,ans);
			}
			assert(dist==_dist);
			for(int i=0;i<loop.size();i++)L[T[loop[i]]].clear();
		}
		long long ans=0;
		for(int i=0;i<N;i++)ans+=(long long)(i+1)*(V[i]+1);
		cout<<ans<<"\n";
	}
}