#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 9;
int a[N], x[N];
vector<int> dp[N];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t; cin >> t;
  while (t--) {
    int n, l, r; cin >> n >> l >> r;
    for (int i = 1; i <= n; i++) {
      cin >> x[i];
    }
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      dp[i].clear();
    }
    deque<int> dq;
    dq.push_back(1);
    int st = 1;
    dp[1].clear();
    if (x[1] == 1) {
      dp[1].push_back(a[1]);
      st = 2;
    }
    auto add = [&](int i) {
      while (!dq.empty() and dp[dq.back()] < dp[i]) {
        dq.pop_back();
      }
      dq.push_back(i);
    };
    auto rem = [&](int i) {
      while (!dq.empty() and dq.front() <= i) {
        dq.pop_front();
      }
    };
    auto get = [&]() {
      if (dq.empty()) return -1;
      return dq.front();
    };
    int lid = 1, rid = 1;
    add(1);
    for (int i = st; i <= n; i++) {
      while (rid + 1 <= n and x[rid + 1] <= x[i] - l) {
        add(++rid);
      }
      while (lid <= n and x[lid] < x[i] - r) {
        rem(lid++);
      }
      int mx = get();
      if (mx != -1) {
        dp[i] = dp[mx];
        dp[i].push_back(a[i]);
        sort(dp[i].rbegin(), dp[i].rend());
      }
      else {
        dp[i].push_back(-1);
      }
    }
    if (find(dp[n].begin(), dp[n].end(), -1) != dp[n].end()) {
      cout << -1 << '\n';
    }
    else {
      cout << dp[n].size() << '\n';
      for (auto x: dp[n]) {
        cout << x << ' ';
      }
      cout << '\n';
    }
  }
  return 0;
}