#include<bits/stdc++.h>

typedef long long ll;
const int mod1 = 999662017, mod2 = 998244353, N = 1e6+10;
int T,n,L,R;
struct Hash
{
	ll x,y;
	Hash(ll a = 0, ll b = 0)
	{
		x = a % mod1, y = b % mod2;
	}
	Hash operator += (const Hash &t) const
	{
		return {x + t.x, y + t.y};
	}
	bool operator == (const Hash &t) const
	{
		return x == t.x && y == t.y;
	}
}val[N];

struct node
{
	int ls,rs,cnt;
	Hash hsh;
}tr[N<<5];
int idx;
int root[N];
int pos[N],a[N];
std::mt19937_64 rnd(5201314);
bool reach[N];

void modify(int p,int q,int l,int r,int d)
{
	tr[q] = tr[p];
	tr[q].hsh += val[d];
	tr[q].cnt++;
	if(l == r)
	{
		tr[q].cnt = 1;
		tr[q].hsh = val[d];
		return;
	}
	int mid = l + r >> 1;
	if(d <= mid)
	{
		tr[q].ls = ++idx;
		modify(tr[p].ls,tr[q].ls,l,mid,d);
	}
	else
	{
		tr[q].rs = ++idx;
		modify(tr[p].rs,idx,mid+1,r,d);
	}
}

bool cmp(int p,int q,int l,int r)
{
	if(l == r) return tr[p].cnt <= tr[q].cnt;
	int mid = l + r >> 1;
	if(tr[tr[p].rs].hsh == tr[tr[q].rs].hsh)
		return cmp(tr[p].ls,tr[q].ls,l,mid);
	return cmp(tr[p].rs,tr[q].rs,mid+1,r);
}

void show(int u,int l,int r)
{
	if(l == r)
	{
		for(int i = 0; i < tr[u].cnt; ++i)
			std::cout<<l<<' ';
		return;
	}
	int mid = l + r >> 1;
	show(tr[u].rs,mid+1,r),show(tr[u].ls,l,mid);
}

int main()
{
	std::ios::sync_with_stdio(false),std::cin.tie(0);
	std::cin>>T;
	tr[0] = {0,0,0,Hash()};
	while(T--)
	{
		std::cin>>n>>L>>R;
		for(int i = 1; i <= n; ++i)
			std::cin>>pos[i];
		for(int i = 1; i <= n; ++i)
			std::cin>>a[i];

		for(int i = 1; i <= n; ++i)
			val[i] = Hash(rnd(),rnd());
		for(int i = 1; i <= n; ++i)
			reach[i] = false;
		reach[1] = true;
		std::deque<int> q;
		idx = 0;
		root[1] = ++idx;
		modify(0,idx,1,n,a[1]);
		q.push_back(1);
		int id = 1;

		for(int i = 2; i <= n; ++i)
		{
			while(pos[id+1] + L <= pos[i])
			{
				++id;
				if(!reach[id]) continue;
				assert(id < i && root[id] != 0);

				while(q.size() && cmp(root[q.back()],root[id],1,n)) q.pop_back();
				q.push_back(id);
			}
			while(q.size() && pos[q.front()] < pos[i] - R) q.pop_front();
			if(!q.size()) break;
			reach[i] = true;
			root[i] = ++idx;
			modify(root[q.front()],idx,1,n,a[i]);
		}
		if(!reach[n]) std::cout<<"-1\n";
		else
		{
			std::cout<<tr[root[n]].cnt<<'\n';
			show(root[n],1,n);
			std::cout<<'\n';
		}
	}
	return 0;
}