#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define MULT_TEST 1
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n, m, k, w;
    n = read(), m = read(), k = read(), w = read();
    vector<int> a(n + 2), b(m + 2);
    a[0] = 0, a[n + 1] = INF;
    for (int i = 1; i <= n; i++) a[i] = read();
    sort(a.begin() + 1, a.end());
    b[0] = 0, b[m + 1] = w + 1;
    for (int i = 1; i <= m; i++) b[i] = read();
    sort(b.begin(), b.end());
    vector<int> A;
    for (int i = 1; i <= m + 1; i++) {
        if (b[i] - b[i - 1] == 1) continue;
        int C = *lower_bound(a.begin() + 1, a.end(), b[i - 1] + 1);
        int pos = C, sum = 0, flag = 0;
        vector<int> B;
        while (pos < b[i]) {
            sum++, B.push_back(pos), pos += k;
            if (pos >= b[i]) flag = 1;
            pos = *lower_bound(a.begin() + 1, a.end(), pos);
        }
        if (b[i] - b[i - 1] - 1 < sum * k)
            return printf("-1\n"), void();
        if (flag) {
            reverse(B.begin(), B.end());
            int top = b[i];
            for (auto &u : B) {
                if (u + k - 1 >= top) u = top - k;
                else break;
                top = u;
            }
        }
        for (auto u : B) A.push_back(u);
    }
    printf("%lld\n", (int)A.size());
    for (auto u : A) printf("%lld ", u);
    puts("");
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}