# include <bits/stdc++.h>

const int N=100010,INF=0x3f3f3f3f;

inline int read(void){
	int res,f=1;
	char c;
	while((c=getchar())<'0'||c>'9')
		if(c=='-') f=-1;
	res=c-48;
	while((c=getchar())>='0'&&c<='9')
		res=res*10+c-48;
	return res*f;
}

int n,k;

int a[N];

int qwqa[N],qwqb[N];

std::vector <std::pair <int,int> > qwq;


inline void tr(int *arr,int p,int q){
	qwq.push_back(std::make_pair(p,q));
	
	for(int i=p;i<=p+k-1;++i) qwqa[i-p+1]=arr[i];
	
	for(int i=1,c=0;i<=n;++i) if(i<p||i>p+k-1) qwqb[++c]=arr[i];
	
	if(q==n-k+1){
		int c=0;
		for(int i=1;i<=n-k;++i) arr[++c]=qwqb[i];
		for(int i=1;i<=k;++i) arr[++c]=qwqa[i];
		return;
	}
	
	int c=0,p0=1;
	
	while(p0<q) arr[++c]=qwqb[p0++];
	
	for(int i=1;i<=k;++i) arr[++c]=qwqa[i];
	
	while(p0<=n-k) arr[++c]=qwqb[p0++];
	
	return;
}

inline bool ok(int *arr){
	for(int i=1;i<=n;++i) if(arr[i]!=i) return false;
	return true;
}

int b[N],ref[N];


inline void pr(void){
	printf("YES\n%d\n",(int)qwq.size());
	
	for(auto v:qwq){
		printf("%d %d\n",v.first,v.second);
	}
	
	return;
}

inline void solve_1(void){
	qwq.clear();
	
	for(int i=1;i<=n;++i){
		if(a[i]%n+1!=a[i%n+1]) return puts("NO"),void();
	}
	
	while(a[1]!=1) tr(a,1,2);
	
	pr();
	
	return;
}

inline void solve_2(void){
	qwq.clear();
	
	for(int i=1;i<=n;++i){
		if(a[i]!=i){
			int p=i+1;
			while(a[p]!=i) ++p; 
			tr(a,p,i);
		}
	}
	
	pr();
	
	return;
}

inline int inv(int *arr){
	int ans=0;
	for(int i=1;i<=n;++i) for(int j=i+1;j<=n;++j) if(a[i]>a[j]) ++ans;
	return ans;
}

inline void solve_3(void){
	if(inv(a)%2) return puts("NO"),void();
	qwq.clear();
	for(int i=1;i<=n;++i){
		if(a[i]!=i){
			int p=i+1;
			while(a[p]!=i) ++p;
			if(p!=n) tr(a,p,i);
			else tr(a,n-1,n-2),tr(a,n-1,i);
		}
	}
	pr();
	return;	
}

inline bool valid_1(void){
	for(int i=1;i<=n;++i) if(a[i]!=i) return false;
	return true;
}

inline void debug(bool fl=false){
	if(!fl) return;
	for(int i=1;i<=n;++i) printf("%d ",a[i]);
	puts("");
	return;
}

inline void solve(void){
	if(k%2==0&&inv(a)%2) return puts("NO"),void();
	
	int lim=n-k-2;
	
	for(int i=1,p;i<=lim+2;++i){
		int goal=i;

		if(i==lim+1) goal=n-1;
		if(i==lim+2) goal=n;
		
		if(a[i]!=goal){
			for(;;){
				p=i+1;
				while(a[p]!=goal) ++p;
				if(p+k-1<=n){
					tr(a,p,i);
					break;
				}
				tr(a,n-k+1,i);
			}
		}
	}
	
	debug();
	
	if(k%2){
		for(int i=n-2,p;i>lim+2;--i){
			while(a[n]!=i){
				int goal=a[n];
				while(a[lim+1]!=goal) tr(a,n-k+1,lim+1);
			}
			
			if(a[lim+1]!=i+1){
				int goal=i+1;
				for(;;){
					p=lim+1;
					while(a[p]!=goal) ++p;
					if(p+k-1<n){
						tr(a,p,lim+1);
						break;
					}
					tr(a,n-k,lim+1);
				}
			}
			debug();
			
			while(a[lim+1]!=i) tr(a,n-k+1,lim+1);
			
			debug();
		}
		
		if(a[n-1]<a[n]) tr(a,lim+1,n-k+1);
		else{
			int goal=a[n];
			while(a[lim+1]!=goal) tr(a,lim+1,n-k+1);
			tr(a,lim+2,n-k+1);
		}
	}else{
		for(int i=n-2;i>lim+2;--i){
			while(a[n]!=i&&a[n-1]!=i){
				int goal=a[n];
				while(a[lim+2]!=goal) tr(a,lim+1,n-k+1);
				
//				printf("qwq: "),debug();
				
				tr(a,lim+2,lim+1);
//				tr(a,lim+2,lim+1);
				
				debug();
			}
			
//			printf("tangshi\n");
			
			debug(); 
			
			if(a[n]==i){
				if(a[lim+1]!=i+1){
					int goal=i+1,p;
					for(;;){
						p=lim+1;
						while(a[p]!=goal) ++p;
						if(p+k-1<n){
							tr(a,p,lim+1);
							break;
						}
						tr(a,n-k,lim+1);
					}
				}
				int goal=a[n];
				while(a[lim+2]!=goal) tr(a,lim+1,n-k+1);
				tr(a,lim+2,lim+1);
			}else{
//				if(a[n-])
//				tr(a,lim+1,n-k),printf("bukaboro\n");
				tr(a,lim+1,n-k);
			}
			
//			printf("solved: "),debug();
		}
		
		debug();
		tr(a,lim+1,n-k+1);
	}
	
	pr();
	
	return;
}

int main(void){
//	freopen("abc.in","r",stdin);
//	freopen("abc.out","w",stdout);
	
	int T=read();
	while(T--){
		qwq.clear();
		
		n=read(),k=read();
		
		for(int i=1;i<=n;++i) a[i]=read();
		for(int i=1;i<=n;++i) b[i]=read(),ref[b[i]]=i;
		for(int i=1;i<=n;++i) a[i]=ref[a[i]];
		
		if(k==n){
			puts(valid_1()?"YES\n0":"NO");
			continue;
		}
		
		if(k==n-1){
			solve_1();
			continue;
		}
		
		if(k==1){
			solve_2();
			continue;
		}
		
		if(k==2){
			solve_3();
			continue;
		}
		
		solve();
		
	}
	

	return 0;
}