#include <bits/stdc++.h>

void solve() {
	int n, m, k, w;
	std::cin >> n >> m >> k >> w;
	
	std::vector<int> a(n + 1);
	for (int i = 1; i <= n; ++ i) {
		std::cin >> a[i];
	}
	std::vector<int> b(m + 3);
	b[1] = 0, b[m + 2] = w + 1; 
	for (int i = 2; i <= m + 1; ++ i) {
		std::cin >> b[i];
	}
	
	std::sort(a.begin(), a.end());
	std::sort(b.begin(), b.end());
	
	int cur = 0;
	std::vector<int> ans;
	for (int i = 1; i <= m + 1; ++ i) {
		int l = b[i], r = b[i + 1];
		std::vector<int> g;
		while (cur < n && a[cur + 1] > l && a[cur + 1] < r) {
			cur ++;
			g.push_back(a[cur]);
		}
		if (!g.size()) {
			continue;
		}
		std::vector<int> f;
		int lmin = r, pos = -1;
		for (int j = g.size() - 1; j >= 0; -- j) {
			if (g[j] >= lmin) {
				continue;
			} else {
				if (g[j] - l < k) {
					pos = j;
					break;
				}
				f.push_back(g[j]);
				lmin = g[j] - k + 1;
			}
		}
		if (pos == -1) {
			for (auto j : f) {
				ans.push_back(j - k + 1);
			}
		} else {
			ans.push_back(l + 1);
			int rmax = l + k;
			if (rmax >= r) {
				std::cout << -1 << '\n';
				return ;
			}
			reverse(f.begin(), f.end());
			for (auto j : f) {
				int lpos = j - k + 1;
				if (lpos < rmax) {
					ans.push_back(rmax + 1);
					rmax = rmax + k;
					if (rmax >= r) {
						std::cout << -1 << '\n';
						return ;
					}
				} else {
					ans.push_back(lpos);
					rmax = lpos + k - 1;
				}
			}
		}
	}
	
	std::cout << ans.size() << '\n';
	for (auto i : ans) {
		std::cout << i << ' ';
	}
	std::cout << '\n';
}

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

    int T;
    std::cin >> T;

    while (T --) {
    	solve();
    }

    return 0;
}