#include<bits/stdc++.h>
using namespace std;
using i64=long long;
using u64=unsigned long long;
#define ll long long
const int inf=1e9;
const ll inff=1e18;
using i128=__int128;

void solve(){
    //TLE
    int w,m,k,n;
    cin>>w>>m>>k>>n;
    vector<int> b(m);
    vector<int> a(n);
    for(int i=0;i<w;i++){
        int x;
        cin>>x;
        x--;
        a[x]=1;
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
        b[i]--;
    }
    sort(b.begin(),b.end());
    vector<pair<int,int>> v;
    int pre=-1;
    for(int j=0;j<=m;j++){
        int last=-1;
        for(int i=(j==0?0:b[j-1]+1);i<(j<m?b[j]:n);i++){
            if(a[i]==1 && i>last){
                v.push_back({i,i+k-1});
                last=i+k-1;
            }
        }
        // cout<<'\n'<<j<<' '<<v.size()<<' '<<last<<'\n';
        if(last<(j<m?b[j]:n)){
            pre=v.size()-1; 
            continue;
        }
        int modify=last-(j<m?b[j]:n)+1;
        // cout<<modify<<'\n';
        // cout<<pre<<'\n';
        for(int i=v.size()-1;i>pre;i--){
            v[i].second-=modify;
            v[i].first-=modify;
            if(i>pre+1 && v[i].first>v[i-1].second){
                break;
            }
            if(i>0) modify=v[i-1].second-v[i].first+1;
            // cout<<modify<<'\n';
        }
        if(v[pre+1].first<(j==0?0:b[j-1]+1)){
            cout<<-1<<'\n';
            return;
        }
        pre=v.size()-1; 
    }
    cout<<v.size()<<'\n';
    for(auto [x,_]:v){
        cout<<x+1<<' ';
    }
    cout<<'\n';
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int t=1;
    cin>>t; 
    while(t--){
        solve();
    }
    return 0;
}