#include<iostream>
#include<queue>
#include<cstring>
#include<tuple>
//~FZY.//
#include<bits/stdc++.h>
#define Heap_int priority_queue<int, vector<int>, greater<int>>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define out(x) cout << ((x) ? "YES" : "NO") << endl
#define mod(x, P) (((x) % (P) + (P)) % (P))
//#define mod(x) (((x) % (P) + (P)) % (P))
#define ULL unsigned long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define lowbit(x) ((x) & -(x))
#define LL long long
#define pb push_back
#define gcd __gcd
#define Big __int128
#define endl "\n"
#define x first
#define y second
//#define int LL
using namespace std;
const int N = 2e5 + 10, M = 2e6 + 10, INF = 1e9 + 7, P = 998244353;
vector<int>q[N];
LL g[N],sum[N];
void solve(){
    int n,m,k,w;
    cin>>n>>m>>k>>w;
    for(int i=0;i<=max(n,m)+5;i++)
    q[i].clear(),g[i]=sum[i]=0;
    int a[n],b[m+2];
    for(int i=0;i<n;i++)
    cin>>a[i];
    sort(a,a+n);
    b[0]=0,b[m+1]=w+1;
    for(int i=0;i<m;i++)
    cin>>b[i+1];
    sort(b,b+m+2);
    int l=0,num=0,ans=0;
    for(int i=1;i<m+2;i++)
    {
      int cnt=0,l1=b[i-1];
      while(l<n&&a[l]<b[i])
      {
        sum[cnt+1]=1LL*sum[cnt]+a[l]-l1-1;
        if(a[l]+k>b[i])
        {
            if(sum[cnt+1]<a[l]+k-b[i])
            {
                cout<<-1<<endl;
                return;
            }
            int l2=1,r2=cnt+1;
            while(l2<r2)
            {
                int mid=(l2+r2+1)>>1;
                if(sum[cnt+1]-sum[mid-1]>=a[l]+k-b[i])
                l2=mid;
                else
                r2=mid-1;
            }
            q[num].push_back(a[l]);
            g[num]=q[num][l2-1]-(a[l]+k-b[i]-(sum[cnt+1]-sum[l2]));
           //cout<<num<<" "<<g[num]<<" ";
            int lx=a[l]+k-1;
            while(l<n&&a[l]<=lx)
            l++;
            break;
        }
        q[num].push_back(a[l]);
        int lx=a[l]+k-1;
        l1=lx;
        while(l<n&&a[l]<=lx)
        l++;
        cnt++;
      }
      ans+=q[num].size();
      num++;
    }
    cout<<ans<<endl;
    for(int i=0;i<num;i++)
    {
        int wi=g[i];
        for(int j=0;j<q[i].size();j++)
        {
            if(g[i]&&q[i][j]>=g[i])
            cout<<wi<<" ",wi+=k;
            else
            cout<<q[i][j]<<" ";
        }
    }
    cout<<endl;
}
signed main(){
    IOS;

    int T = 1;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}