#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,N,n,k;
int b[105],c[105],a[105],idx[105];

int m;
int _pa[1000005],_pb[1000005];
void Left(int l,int r){//向左 shift
	assert(r - l + 1 == k);
	++m;
	_pa[m] = l + 1;
	_pb[m] = l;
	rep(i,l,r - 1) swap(a[i],a[i + 1]);
}

void Right(int l,int r){//向右 shift
	assert(r - l + 1 == k);
	++m;
	_pa[m] = l;
	_pb[m] = l + 1;
	per(i,r - 1,l) swap(a[i],a[i + 1]);
} 

void report(){
	printf("YES\n%d\n",m);
	rep(i,1,m) printf("%d %d\n",_pa[i],_pb[i]);
	rep(i,1,N) assert(a[i] == i);
}

void solve(){
	scanf("%d%d",&n,&k);
	m = 0;
	N = n;
	k++;
	rep(i,1,n) scanf("%d",&b[i]);
	rep(i,1,n){
		scanf("%d",&c[i]);
		idx[c[i]] = i;
	}
	rep(i,1,n) a[i] = idx[b[i]];
//	rep(i,1,n) printf("%d ",a[i]);
//	printf("\n");

	int diff = 0;
	if(k == n + 1){
		rep(i,1,n) diff += a[i] != i;
		if(!diff) report();
		else printf("NO\n");
		return;
	}
	if(k == n){
		rep(p,0,n){
			diff = 0;
			rep(i,1,n) diff += a[i] != i;
			if(!diff){
				report();
				return;
			}
			Left(1,n);
		}
		printf("NO\n");
		return;
	}
	while(n > k + 1){
		int pos = -1;
		rep(i,1,n) if(a[i] == n) pos = i;

		while(pos + k - 1 <= n){
			Right(pos,pos + k - 1);
			pos++;
		}
		while(pos < n){
			Right(n - k + 1,n);
			pos++;
		}
		n--;
	}

	rep(p,1,n - 2){
//		rep(i,1,n) printf("%d ",a[i]);
//		printf("\n");
		int pos = -1;
		rep(i,1,n) if(a[i] == p) pos = i;
		if(pos == 1){
			Left(2,n);
			rep(s,1,n - 2) Left(1,n - 1);
//			printf("After sp:\n");
//			rep(i,1,n) printf("%d ",a[i]);
//			printf("\n");
		}
		pos = -1;
		rep(i,1,n) if(a[i] == p) pos = i;
		assert(pos != 1);

		if(pos == n){
			Left(2,n);
			continue;
		}
		rep(s,1,pos - 2) Left(1,n - 1);
		Left(2,n);
//		printf("current:\n");
//		rep(i,1,n) printf("%d ",a[i]);
//		printf("\n");
		if(p == 1){
			Left(2,n);
			continue;
		}
		pos = -1;
		rep(i,1,n) if(a[i] == p - 1) pos = i;
		if(pos != n - 1) rep(s,1,pos) Left(1,n - 1);
//		printf("awa\n");
//		rep(i,1,n) printf("%d ",a[i]);
//		printf("\n");
		Left(2,n);
	}
	Left(1,n - 1);
	if(a[n - 1] == n - 1){
		report();
		return;
	}
//	rep(i,1,n) printf("%d ",a[i]);
//	printf("\n");
	if(n % 2 == 0){
		printf("NO\n");
		return;
	}
	rep(i,1,n / 2){
		if(i > 1) Left(1,n - 1);
		Left(2,n);
	}
	Left(1,n - 1);Left(1,n - 1);
	report();
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}