#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n, k, x, y;
    cin >> n >> k >> x >> y;
    if(k == 1) {
        int last = x + n - 1;
        if(last > y) {
            cout << "No" << endl;
            return 0;
        }
        cout << "Yes" << endl;
        rep(i, n-1) cout << x+i << " ";
        cout << y << endl;
        return 0;
    }
    if(y == 0) {
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;

    vector<int> loop;
    if(k&1) {
        loop = vector<int>(k-2, x);
        loop.push_back(1);
        loop.push_back(1^x);
    } else {
        loop = vector<int>(1, x);
    }

    vector<int> ans;
    while(ans.size() < n-1) {
        for(int x: loop) ans.push_back(x);
    }
    while(ans.size() > n-1) ans.pop_back();
    ans.push_back(y);
    cout << ans << endl;
    return 0;
}