#include<bits/stdc++.h>
using namespace std;
int n,a[1005],b[1005],c[1005],d[1005],T;
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int i=1;i<=n;++i){
			scanf("%d",&a[i]);
			c[i]=a[i];
		}
		for(int i=1;i<=n;++i){
			scanf("%d",&b[i]);
			d[i]=b[i];
		}
		bool p=1;
		sort(c+1,c+n+1);
		sort(d+1,d+n+1);
		for(int i=1;i<=n;++i)
			if(c[i]!=d[i]){
				p=0;
				break;
			}
		if(!p){
			puts("No");
			continue;
		}
		puts("Yes");
		for(int i=1;i<=n;++i){
			int k;
			for(k=i;k<=n;++k)
				if(a[k]==b[i])
					break;
			for(;k>i;--k){
				swap(a[k],a[k-1]);
				printf("%d %d\n",k,k-1);
			}
		}
		puts("0 0"); 
	}
	return 0;
}