#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static random_device rd;
  static mt19937_64 gen(rd());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n, m1, m2, t;
  cin >> n >> m1 >> m2 >> t;
  vi lw = readvi(m1);
  vi up = readvi(m2);
  vi pos{0, n + 1};
  for (ll i = ll(0); i < ll(m1); i++) {
    pos.push_back(lw[i]);
    pos.push_back(lw[i] - 1);
    pos.push_back(lw[i] + 1);
  }
  for (ll i = ll(0); i < ll(m2); i++) {
    pos.push_back(up[i]);
    pos.push_back(up[i] - 1);
    pos.push_back(up[i] + 1);
  }
  mkuni(pos);
  ll s = ll(pos.size());
  vc<array<char, 2>> obs(s);
  for (auto v : lw) obs[lwb(pos, v)][0] = 1;
  for (auto v : up) obs[lwb(pos, v)][1] = 1;
  vc<array<pi, 2>> dp(s, {pi(-inf, -1), pi(-inf, -1)});
  dp[0][0] = pi(0, -1);
  dp[0][1] = pi(0, 1);
  for (ll i = ll(0); i < ll(s - 1); i++) {
    for (ll j = ll(0); j < ll(2); j++)
      if (dp[i][j].first >= 0) {
        if (obs[i + 1][j]) {
          ll z = max(ll(0), t - dp[i][j].first);
          if (pos[i] + z < pos[i + 1])
            dp[i + 1][j] = pi(dp[i][j].first + pos[i + 1] - pos[i] - t, 0);
        } else {
          dp[i + 1][j] = pi(dp[i][j].first + pos[i + 1] - pos[i], 0);
        }
      }
    for (ll j = ll(0); j < ll(2); j++) {
      ll w = min(t, dp[i + 1][j].first);
      if (w > dp[i + 1][j ^ 1].first && !obs[i + 1][j ^ 1]) {
        dp[i + 1][j ^ 1] = pi(w, 1);
      }
    }
  }
  if (dp[s - 1][0].first >= 0) {
    yes(0);
    vi vert;
    vc<pi> shot;
    auto makeshot = [&](ll x, ll y, ll c, ll num) {
      assert(c <= t);
      ll d = t - c;
      for (ll i = ll(num) - 1; i >= ll(0); i--)
        shot.emplace_back(x + t * i + d, y + 1);
    };
    ll x = s - 1, y = 0, cur = 0;
    while (dp[x][y].second != -1) {
      if (dp[x][y].second == 0) {
        cur += obs[x][y];
        x--;
      } else {
        makeshot(pos[x], y, dp[x][y].first, cur);
        cur = 0;
        vert.push_back(pos[x]);
        y ^= 1;
      }
    }
    makeshot(0, 0, 0, cur);
    reverse(vert.begin(), vert.end());
    reverse(shot.begin(), shot.end());
    print(ll(vert.size()));
    print(vert);
    print(ll(shot.size()));
    for (auto v : shot) {
      print(v.first, 2);
      print(v.second);
    }
  } else {
    no();
  }
}
