#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

VI solve() {
  int n, k, x, y;
  cin >> n >> k >> x >> y;
  if (y == 0) return {};
  VI a(n);
  if (k == 1) {
    if (x + n - 1 > y) return {};
    rep(i, n - 1) a[i] = x + i;
    a[n-1] = y;
  } else if (k == n - 1) {
    a[0] = a[n-2] = x;
    a[n-1] = y;
  } else if (k == n - 2) {
    if (x == 0) {
      if (y == 1) return {};
      a[n-2] = 1;
      a[n-1] = y;
    } else {
      a[0] = a[n-3] = a[n-2] = x;
      a[n-1] = y;
    }
  } else if (x) {
    VI b(k);
    if (k % 2 == 0) b.assign(k, x);
    else {
      b[0] = b[1] = x;
      int v = x == 1 ? 2 : 1;
      for (int i = 1; i < k; i++) b[i] ^= v;
    }
    rep(i, n-1) a[i] = b[i%k];
    a[n-1] = y;
  } else {
    VI b(k, 3);
    if (k % 2) b[k-1] = 1, b[k-2] = 2;
    rep(i, n-1) a[i] = i == 0 ? 0 : i == 1 ? b[1] ^ 1 : b[i%k];
    a[n-1] = y;
  }
  return a;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  auto ans = solve();
  if (ans.empty()) {
    cout << "No\n";
  } else {
    cout << "Yes\n";
    rep(i, ssize(ans)) cout << ans[i] << " \n"[i + 1 == ssize(ans)];
  }
}