// Author: kyEEcccccc

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using ULL = unsigned long long;

#define F(i, l, r) for (int i = (l); i <= (r); ++i)
#define FF(i, r, l) for (int i = (r); i >= (l); --i)
#define MAX(a, b) ((a) = max(a, b))
#define MIN(a, b) ((a) = min(a, b))
#define SZ(a) ((int)((a).size()) - 1)

constexpr int N = 1000005;
constexpr ULL B = 10086001;

ULL pwb[N];

struct SegTreeNode
{
	ULL x;
	int ls, rs;
};

SegTreeNode tr[N * 21];
int tot_nd;

int add(int p, int cl, int cr, int pos, int x)
{
	int pp = ++tot_nd;
	tr[pp] = tr[p];
	if (cl == cr) return tr[pp].x += x, pp;
	int cm = (cl + cr) >> 1;
	if (pos <= cm) tr[pp].ls = add(tr[p].ls, cl, cm, pos, x);
	else tr[pp].rs = add(tr[p].rs, cm + 1, cr, pos, x);
	tr[pp].x = tr[tr[pp].ls].x * pwb[cr - cm] + tr[tr[pp].rs].x;
	return pp;
}

bool cmp(int u, int v, int cl, int cr)
{
	if (cl == cr) return tr[u].x < tr[v].x;
	int cm = (cl + cr) >> 1;
	if (tr[tr[u].rs].x == tr[tr[v].rs].x) return cmp(tr[u].ls, tr[v].ls, cl, cm);
	else return cmp(tr[u].rs, tr[v].rs, cm + 1, cr);
}

vector<int> ans;

void print(int p, int cl, int cr)
{
	if (cl == cr)
	{
		// F(i, 1, tr[p].x) cout << cl << ' ';
		F(i, 1, tr[p].x) ans.push_back(cl);
		return;
	}
	int cm = (cl + cr) >> 1;
	print(tr[p].rs, cm + 1, cr);
	print(tr[p].ls, cl, cm);
}

int n, dl, dr, a[N], b[N];
int rt[N];

void work(void)
{
	cin >> n >> dl >> dr;
	F(i, 1, n) cin >> a[i];
	F(i, 1, n) cin >> b[i];

	deque<int> deq{1};
	tot_nd = 0;
	rt[1] = add(0, 1, n, b[1], 1);
	int p = 1;
	F(i, 2, n)
	{
		while (a[i] - a[p] >= dl)
		{
			while (!deq.empty() && !cmp(rt[p], rt[deq.back()], 1, n)) deq.pop_back();
			deq.push_back(p);
			++p;
		}
		while (!deq.empty() && a[i] - a[deq.front()] > dr) deq.pop_front();
		if (deq.empty() || rt[deq.front()] == 0) rt[i] = 0;
		else rt[i] = add(rt[deq.front()], 1, n, b[i], 1);
	}

	if (rt[n] == 0) cout << "-1\n";
	else
	{
		ans.clear();
		print(rt[n], 1, n);
		cout << ans.size() << '\n';
		for (auto x : ans) cout << x << ' ';
		cout << '\n';
	}
}

signed main(void)
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0), cin.tie(nullptr);

	pwb[0] = 1;
	F(i, 1, 1000000) pwb[i] = pwb[i - 1] * B;

	int _; cin >> _;
	while (_--) work();
	
	return 0;
}