#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, K, X, Y;
    cin >> N >> K >> X >> Y;
    if (Y == 0){
        yneos(false);
        return;
    }
    if (K == 1){
        if (yneos(Y - X >= N - 1)){
            vector<int> ans(N);
            ans[0] = X;
            rep(i, 1, N - 1) ans[i] = ans[i - 1] + 1;
            ans[N - 1] = Y;
            vec_out(ans);
        }
        return;
    }
    srand(167);
    if (X != 0) {
        vector<int> p;
        while (p.empty()) {
            p.push_back(X);
            int sum = X;
            rep(rp, 1, K - 1) {
                int tmp = (rand() & ((1 << 20) - 1));
                if (tmp == 0) {
                    sum = 0;
                    break;
                }
                sum ^= tmp;
                p.push_back(tmp);
            }
            if (sum == 0) {
                p.clear();
            } else {
                p.push_back(sum);
            }
        }
        rep(i, 0, N - 1 - K) p.push_back(p[i]);
        p.push_back(Y);
        if (yneos(Y)) {
            vec_out(p);
        }
        return;
    }
    if (N == K + 1){
        vector<int> ans(N);
        ans[0] = X, ans[1] = X;
        ans[N - 1] = Y;
        yneos(true);
        vec_out(ans);
        return;
    }
    if (Y != 1){
        vector<int> p;
        while (p.empty()) {
            int sum = 1;
            rep(rp, 0, K - 1) {
                int tmp = (rand() & ((1 << 20) - 1));
                if (tmp < 2) {
                    sum = 0;
                    break;
                }
                sum ^= tmp;
                p.push_back(tmp);
            }
            if (sum < 2 || sum % 2 == 0) {
                p.clear();
            } else {
                p.push_back(sum);
            }
        }
        p.insert(p.begin(), 0);
        rep(i, 1, N - 1 - K) p.push_back(p[i]);
        p.push_back(Y);
        if (yneos(Y)) {
            vec_out(p);
        }
        return;
    }
    assert(false);
}

/*
 * K = 1 のときは　ok
 * K != 1 のときは常に yes なのかな？あんまりわかっていない
 * K が偶数ならイージー
 *
 * X != 0 なら適当にすれば A[i - K],...,A[i - 1] を 0 にして適当に
 * X = 0 のときがわからない
 * 例えば、Y = 1 かつ、K + 2 = N のときは No である
 * Y != 1 なら適当にすれば良さそう
 * K 個の Xor を 1 にすればいい
 * X = 0, Y = 1 はテストケースになさそう
 */