//dpi:跳到i的最大字典序序列.
//注意到序列 a<b, 则插入相同的数后仍然有a*<b* !!!
//单调队列优化一个n, 持久化+序列hash+主席树上二分 logn时间内判断两个序列的大小关系
#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
#define ull unsigned long long
#define mi int mid=(l+r)/2;
const int N=1e6+6,M=25,inf=1e9+9; //mod=1e9+9;
int ls[N*M],rs[N*M],num[N*M],cnt,rt[N];
ull w[N*M],pw[N];
int a[N],q[N],x[N];
int res[N],top;
void dfs(int rt,int l,int r){
    if(!rt)return;
    if(l==r){
        rep(_,1,num[rt])res[++top]=l; return;
    }
    mi
    dfs(rs[rt],mid+1,r); dfs(ls[rt],l,mid);
}
int crt(int rt,int l,int r,int x){
    int now=++cnt;
    if(l==r){
        num[now]=num[rt]+1; w[now]=(w[rt]*pw[1]+x);
        return now;
    }
    mi
    if(mid>=x)ls[now]=crt(ls[rt],l,mid,x),rs[now]=rs[rt];
    else rs[now]=crt(rs[rt],mid+1,r,x),ls[now]=ls[rt];
    num[now]=num[ls[now]]+num[rs[now]];
    w[now]=(w[ls[now]]+w[rs[now]]*pw[num[ls[now]]]);
    return now;
}
bool qu(int rt1,int rt2,int l,int r){
    if(l==r)return num[rt1]<=num[rt2]; //傻逼成num[l]<=num[r]了..
    mi
    if(w[rs[rt1]]!=w[rs[rt2]])return qu(rs[rt1],rs[rt2],mid+1,r);
    return qu(ls[rt1],ls[rt2],l,mid);
}
void slv(){
    rep(i,0,cnt){
        ls[i]=rs[i]=num[i]=w[i]=0;
    }
    cnt=0;
    int n,L,R; cin>>n>>L>>R;
    pw[0]=1;
    rep(i,1,n)pw[i]=inf*pw[i-1]; //cout<<pw[i]<<' '; cout<<'\n';
    rep(i,1,n)cin>>x[i];
    rep(i,1,n)cin>>a[i];
    int l=1,r=0;
    rt[1]=crt(0,1,n,a[1]);
    q[++r]=1; int wzh=1;
    auto cmp=[&](int i,int j){
        return qu(rt[i],rt[j],1,n);
    };
    rep(i,2,n){
        if(x[1]>x[i]-L){
            rt[i]=-1; continue;
        }
        while(x[wzh+1]<=x[i]-L){
            ++wzh;
            if(rt[wzh]==-1)continue;
            while(r>=l && cmp(q[r],wzh))--r;
            q[++r]=wzh;
        }
        while(l<=r && x[q[l]]<x[i]-R)++l;
        if(l>r || x[q[l]]>x[i]-L)rt[i]=-1;
        else {
            assert(x[q[l]]>=x[i]-R && x[q[l]]<=x[i]-L);
            rt[i]=crt(rt[q[l]],1,n,a[i]);
        }
        // top=0; dfs(rt[i],1,n);
        // cout<<i<<": "; rep(i,1,top)cout<<res[i]<<' '; cout<<'\n';
    }
    if(rt[n]==-1){
        cout<<"-1\n";return;
    }
    top=0; dfs(rt[n],1,n);
    cout<<top<<'\n'; //忘了...
    rep(i,1,top)cout<<res[i]<<' '; cout<<'\n';
}
signed main(){
    IOS
    int T;cin>>T;
    while(T--)slv();
}
/*
57 8 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

1
10 2 4
1 2 3 4 5 6 7 8 9 10
9 10 9 4 7 4 7 9 6 10

1
5 2 3
1 2 3 4 5
5 2 3 1 4
*/