#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=N*40+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,L,R,A[N],B[N];
int Ro[N],tg[N];ll Po[N];
vector<int> ans;
namespace Tree{
	ll f[M];int L[M],R[M],Ct;
	void Cl(){for(int i=1;i<=Ct;i++) L[i]=R[i]=f[i]=0;Ct=0;}
	void up(int v,int len){f[v]=(f[L[v]]+f[R[v]]*Po[len])%mod;}
	void CP(int &v){f[++Ct]=f[v];L[Ct]=L[v];R[Ct]=R[v];v=Ct;}
	void add(int x,int &v,int l=1,int r=n){
		CP(v);if(l==r) {f[v]++;return;}
		int m=l+r>>1;x<=m?add(x,L[v],l,m):add(x,R[v],m+1,r);up(v,m-l+1);
	}
	int cmp(int x,int y,int l=1,int r=n){
		if(l==r) return f[x]<f[y];int m=l+r>>1;
		return f[R[x]]^f[R[y]]?cmp(R[x],R[y],m+1,r):cmp(L[x],L[y],l,m);
	}
	void print(int v,int l=1,int r=n){
		if(!v) return;
		if(l==r) {while(f[v]--) ans.emplace_back(l);return;}
		int m=l+r>>1;print(R[v],m+1,r);print(L[v],l,m);
	}
}
int q[N],H,T;
void Solve(){
	int i,j;scanf("%d%d%d",&n,&L,&R);
	for(Po[0]=i=1;i<=n;i++) Po[i]=Po[i-1]*137%mod;
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	for(i=1;i<=n;i++) scanf("%d",&B[i]);
	Tree::Cl();fill(Ro+1,Ro+n+1,0);fill(tg+1,tg+n+1,0);
	tg[1]=1;Tree::add(B[1],Ro[1]);
	H=1;T=0;int r=1;
	for(i=2;i<=n;i++){
		while(A[r]+L<=A[i]) {
			if(tg[r]) {
				while(H<=T&&Tree::cmp(Ro[q[T]],Ro[r])) T--;q[++T]=r; 
			}
			r++;
		}
		while(H<=T&&A[q[H]]+R<A[i]) H++;
		if(H<=T) tg[i]=1,Ro[i]=Ro[q[H]],Tree::add(B[i],Ro[i]);
	}
	if(!tg[n]){puts("-1");return;}
	ans.clear();Tree::print(Ro[n]);
	printf("%d\n",ans.size());
	for(int i:ans) printf("%d ",i);printf("\n");
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}