#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll base = 19260817;
const ll mod = 998244353;
const int maxn = 1e6 + 5;
const int N = 2e7 + 5;

int a[maxn], x[maxn];
ll mi[maxn];

int q[maxn], hd, tl;
int rt[maxn], cnt;
bool blk[maxn];

struct Tree
{
    int ls[N], rs[N], vl[N];
    ll hs[N];

    int update(int p, int l, int r, int x)
    {
        int k = ++cnt; ls[k] = ls[p], rs[k] = rs[p], hs[k] = (hs[p] + mi[x]) % mod, vl[k] = vl[p] + 1;
        if (l == r) return k;
        int mid = (l + r) >> 1;
        if (x <= mid) ls[k] = update(ls[p], l, mid, x);
        else rs[k] = update(rs[p], mid + 1, r, x);
        return k;
    }

    bool cmp(int k1, int k2, int l, int r)
    {
        if (!k1) return true;
        if (!k2) return false;
        if (l == r) return (vl[k1] <= vl[k2]);
        int mid = (l + r) >> 1;
        if (hs[ls[k1]] != hs[ls[k2]]) return cmp(ls[k1], ls[k2], l, mid);
        else return cmp(rs[k1], rs[k2], mid + 1, r);
    }

    void travel(int k, int l, int r)
    {
        if (!k) return;
        if (l == r)
        {
            for (int i = 1; i <= vl[k]; i++) cout << l << " ";
            return;
        }
        int mid = (l + r) >> 1;
        travel(rs[k], mid + 1, r); travel(ls[k], l, mid);
    }
}T;

void work()
{
    int n, L, R;
    cin >> n >> L >> R; cnt = 0;
    for (int i = 1; i <= n; i++) rt[i] = blk[i] = 0;
    for (int i = 1; i <= n; i++) cin >> x[i];
    for (int i = 1; i <= n; i++) cin >> a[i];

    hd = 1, tl = 0; int pos = 1;
    for (int i = 1; i <= n; i++)
    {
        while (pos <= n && x[pos] <= x[i] - L)
        {
            if (blk[pos]) { pos++; continue; }
            while (hd <= tl && T.cmp(rt[q[tl]], rt[pos], 1, n)) tl--;
            q[++tl] = pos++;
        }
        while (hd <= tl && x[q[hd]] < x[i] - R) hd++;
        if (hd <= tl) rt[i] = T.update(rt[q[hd]], 1, n, a[i]);
        else if (i == 1) rt[i] = T.update(0, 1, n, a[i]);
        else blk[i] = 1;
    }

    if (blk[n]) return cout << "-1\n", void();
    cout << T.vl[rt[n]] << "\n";
    T.travel(rt[n], 1, n);
    cout << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T; cin >> T;
    mi[0] = 1; for (int i = 1; i < maxn; i++) mi[i] = mi[i - 1] * base % mod;
    while (T--) work();
	return 0;
}