#include <bits/stdc++.h>

using namespace std;

#define int long long

void solve() {
    int n, m, k, w;
    std::cin >> n >> m >> k >> w;

    std::vector<int> a(n + 1), b(m + 3);
    b[1] = 0;
    for (int i = 1; i <= n; i++) {
        std::cin >> a[i];
    }

    std::map<int, int> isb;

    for (int i = 2; i <= m + 1; i++) {
        std::cin >> b[i];
        isb[b[i]] = 1;
    }
    b[m + 2] = w + 1;

    for (int i = 1; i <= n; i++) {
        if (isb[a[i]]) {
            std::cout << "-1\n";
            return;
        }
    }

    std::sort(a.begin() + 1, a.end());
    std::sort(b.begin() + 1, b.end());

    std::vector<int> res;
    int j = 1;
    int ans = 0;
    for (int i = 2; i <= m + 2; i++) {
        int L = b[i - 1] + 1;
        int R = b[i] - 1;
        // std::cerr << L << " " << R << "\n";

        std::vector<int> vec;
        while(j <= n && a[j] < R) {
            vec.push_back(a[j]);
            j++;
        }

        // std::cerr << "!!!" << L << " " << R << std::endl;
        // for (auto x : vec) {
        //     std::cerr << x << " ";
        // }
        // std::cerr << std::endl;

        if (vec.size() == 0) {
            continue;
        }

        std::vector<int> q;
        for (auto x : vec) {
            if (q.size() == 0 || q.back() + k - 1 < x) {
                q.push_back(x);
            }
        }

        for (int i = q.size() - 1; i >= 0; i--) {
            if (i == q.size() - 1) {
                if (q[i] + k - 1 > R) {
                    q[i] = R - k + 1;
                }
            } else {
                if (q[i] + k - 1 > q[i + 1]) {
                    q[i] = q[i + 1] - k + 1;
                }
            }
        }
        for (auto x : q) {
            res.push_back(x);
        }
        if (q[0] < L) {
            ans += 1000000000;
        } else {
            ans += q.size();
        }
    }
    std::cout << (ans < 1E9 ? ans : -1) << "\n";
    if (ans < 1E9) {
        for (auto x : res) {
            std::cout << x << " ";
        }
        std::cout << "\n";
    }


}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    // freopen("K.in", "r", stdin);

    int t = 1;
    std::cin >> t;

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