#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

using namespace std;

int c[1001];
int calive[1001];
int cs[1001];
int s[1001];
int se[1001];
int n, m, T;


typedef struct {
	int c;
	int s;
}cws;

bool compare(cws a, cws b){
	if(a.s>b.s)
		return true;
	else if(a.s<b.s)
		return false;
	else{
		return a.c>b.c;
	}
		
}

int find_largest_empty_shell(int ci, int D){
	int si=-1;
	int max=-1;
	for (int i=0; i<m; i++){
		//cout<<se[i]<<" "<<s[i]<<" "<<D<<endl;
		if(s[i] > max && se[i]==0 && s[i]>=c[ci] && s[i]<=(c[ci]+D)){
			max=s[i];
			si=i;
		}
	}
	return si;
}


int main(){
	FILE *in = fopen("crabs.in", "r");
	int K;
	fscanf(in, "%d\n", &K);

	vector<int> lc;
	for(int k=0;k<K;k++){
		int D;
		lc.clear();
		fscanf(in, "%d %d %d %d\n", &n, &m, &D, &T);
		memset(se, 0, sizeof(se));
		memset(calive, 0, sizeof(calive));

		
		for (int i=0; i<n; i++){
			fscanf(in, "%d\n", &c[i]);
			cs[i]=i;
			se[i]=1;
			calive[i]=1;
			//cout<<c[i]<<endl;
		}

		for (int i=0; i<m; i++){
			fscanf(in, "%d\n", &s[i]);
			//cout<<s[i]<<endl;
		}
		//if(k==0)
		//	continue;

		int out_time=T;
		for (int i=0; i<n; i++){
			if((s[i]-c[i]+1)<out_time){
				out_time=s[i]-c[i]+1;
			}
		}

		int last_out_time=0;
		for(int t=out_time;t<=T;){
			//cout<<"t: "<<t<<endl;
			lc.clear();
			for (int i=0; i<n; i++){
				c[i]+=(t-last_out_time);
				
				//cout<<i<<"] size: "<<c[i]<<" "<<calive[i]<<" "<<" "<<cs[i]<<" "<<s[cs[i]]<<endl;
				if(calive[i]==1 && c[i]>s[cs[i]]){
					se[cs[i]]=0;
					cs[i]=-1;
					lc.push_back(i);
				}
				//cout<<i<<"] size: "<<c[i]<<" "<<calive[i]<<" "<<" "<<cs[i]<<" "<<s[cs[i]]<<endl;
			}
			last_out_time=t;
			vector<cws> cwsl;
			cwsl.clear();
			for(int i=0; i<lc.size(); i++){
				int si = find_largest_empty_shell(lc[i], D);
				//cout<<si<<" for "<<lc[i]<<endl;
				if(si<0){
					calive[lc[i]]=0;
					continue;
				}
				cws c1;
				c1.c = lc[i];
				c1.s = si;
				cwsl.push_back(c1);
			}

			int out_t=T;
			if(cwsl.size()==0){
				for (int i=0; i<n; i++){
					if(calive[i]==1 && (s[cs[i]]-c[i]+1)<out_t){
						out_t=s[cs[i]]-c[i]+1;
					}
				}
				t+=out_t;
				continue;
			}

			


			sort(cwsl.begin(),cwsl.end(),compare);
			int pccc = cwsl[0].c;
			int psss = cwsl[0].s;
			cs[pccc]=psss;
			se[psss]=1;
			int ccc,sss;
			for(int i=1; i<cwsl.size();i++){
				ccc=cwsl[i].c;
				sss=cwsl[i].s;
				if(sss==psss){	//ccc die
					calive[ccc]=0;
					continue;
				}
				pccc=ccc;
				psss=sss;
				cs[pccc]=psss;
				se[psss]=1;
			}

				for (int i=0; i<n; i++){
					if(calive[i]==1 && (s[cs[i]]-c[i]+1)<out_t){
						out_t=s[cs[i]]-c[i]+1;
					}
				}
				t+=out_t;
			
		}
		cout<<"Data Set "<<k+1<<":\n";
		for (int i=0; i<n; i++){
			if(calive[i]==1){
				cout<<i+1<<endl;
			}
		}
		cout<<endl;
	}

	//int hello;
	//cin>>hello;

	return 0;
}