#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e6 + 5;
const int MAXP = MAXN * 20;

mt19937 gen(114514);

const int mod = 1e9 + 7;
const int base = uniform_int_distribution<int>(1, mod / 10)(gen) + mod / 10;

int pwbase[MAXN];

namespace SegT
{
	int ls[MAXP], rs[MAXP], val[MAXP], pcnt;
	#define lson(u) ls[u],l,mid
	#define rson(u) rs[u],mid+1,r
	int new_Node(int v)
	{
		int u = ++pcnt;
		ls[u] = ls[v]; rs[u] = rs[v];
		val[u] = val[v];
		return u;
	}
	void insert(int &u,int l,int r,int q)
	{
		u = new_Node(u);
		if(l == r){ ++val[u]; return;}
		int mid = (l+r)>>1;
		if(q<=mid) insert(lson(u),q);
		else insert(rson(u),q);
		val[u] = ((ll)val[ls[u]] * pwbase[r-mid] + val[rs[u]]) %mod;
	}
	int cmp(int u,int v,int l,int r)
	{
		if(val[u] == val[v]) return 0;
		if(l == r) return val[u] - val[v];
		int mid = (l+r)>>1;
		int res = cmp(rs[u], rson(v));
		return res == 0? cmp(ls[u], lson(v)): res;
	}
	void dfs(int u,int l,int r,vector<int> &res)
	{
		if(u == 0) return;
		if(l == r)
		{
			res.insert(res.end(), val[u], l);
			return;
		}
		int mid = (l+r)>>1;
		dfs(rson(u),res); dfs(lson(u),res);
	}
}

int a[MAXN], b[MAXN];

void solve(void)
{
	int n,L,R;
	scanf("%d%d%d",&n,&L,&R);
	for(int i=1; i<=n; ++i)
		scanf("%d",&a[i]);
	for(int i=1; i<=n; ++i)
		scanf("%d",&b[i]);
	
	SegT :: pcnt = 0;
	
	static int rt[MAXN];
	fill(rt+1, rt+n+1, 0);
	
	static int q[MAXN];
	int hd = 1, tl = 0;
	
	auto push = [&] (int i)
	{
		if(rt[i] == -1) return;
		while(hd <= tl && SegT :: cmp(rt[q[tl]], rt[i], 1, n) <= 0)
			--tl;
		q[++tl] = i;
	};
	
	SegT :: insert(rt[1],1,n, b[1]);
	
	for(int i=2,j=1; i<=n; ++i)
	{
		while(a[j] <= a[i] - L)
			push(j), ++j;
		while(hd <= tl && q[hd] < a[i] - R)
			++hd;
		
		if(hd > tl)
		{
			rt[i] = -1;
			continue;
		}
		
		rt[i] = rt[q[hd]];
		SegT :: insert(rt[i],1,n, b[i]);
	}
	
	if(rt[n] == -1)
	{
		printf("-1\n");
		return;
	}
	
	vector<int> res;
	SegT :: dfs(rt[n],1,n,res);
	
	printf("%d\n",(int)res.size());
	for(auto t: res)
		printf("%d ",t);
	printf("\n");
}

int main(void)
{
	pwbase[0] = 1;
	for(int i=1; i<MAXN; ++i)
		pwbase[i] = (ll)pwbase[i-1] * base %mod;
	
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}