#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n, k, x, y; in(n,k,x,y);
    if (y == 0){
        no();
        return ;
    }
    auto say = [&](vector<int> a){
        yes();
        out(a);
        cout << flush;
        assert(a[0] == x && a[n-1] == y);
        int rui = 0;
        rep(i,k){
            rui ^= a[i];
        }
        repp(i,k,n){
            assert(rui < a[i]);
            rui ^= a[i];
            rui ^= a[i-k];
        }
    };
    if (k % 2 == 0){
        if (x > 0){
            vector<int> ans(n,x);
            ans[n-1] = y;
            say(ans);
            return ;
        }
        if (k <= n-3){
            vector<int> ans(n,3);
            ans[0] = 0;
            ans[1] = 1;
            ans[n-1] = y;
            say(ans);
            return ;
        }
        if (k == n-2){
            if (y > 1){
                vector<int> ans(n,0);
                ans[n-2] = 1;
                ans[n-1] = y;
                say(ans);
                return ;
            }
            else {
                no();
                return ;
            }
        }
        if (k == n-1){
            vector<int> ans(n,0);
            ans[n-1] = y;
            say(ans);
            return ;
        }
    }
    else {
        if (k == 1){
            if (x+n-1 <= y){
                vector<int> ans(n); iota(all(ans),x);
                ans[n-1] = y;
                say(ans);
                return ;
            }
            else {
                no();
                return ;
            }
        }
        if (x > 0){
            auto get = [&](int i){
                i %= k;
                return min(i+1,3);
            };
            int d = [&]() -> int {
                reb(i,19){
                    if (x >> i & 1) return i;
                    if (x >> (i+1) & 1) return i;
                }
                abort();
            }();
            int msk = (1<<d)-1;
            int offset = [&](){
                int b0 = (x >> d & 1);
                int b1 = (x >> (d+1) & 1);
                if (b0 == 0 && b1 == 1){
                    return 1;
                }
                else if (b0 == 1 && b1 == 0){
                    return 0;
                }
                else {
                    return 2;
                }
            }();
            vector<int> ans(n,x&msk);
            rep(i,n){
                int b = get(offset+i);
                if (i % k == k-1){
                    ans[i] = 0;
                }
                rep(j,2){
                    ans[i] |= (b >> j & 1) << (d + j);
                }
            }
            ans[0] = x;
            ans[n-1] = y;
            say(ans);
            return ;
        }
        else {
            if (k <= n-3){
                vector<int> ans(n);
                ans[1] = 1;
                repp(i,2,n-1){
                    int mo = (i - 2) % k;
                    ans[i] = (mo < k-2 ? 1 : mo == k-2 ? 2 : 3);
                }
                ans[n-1] = y;
                say(ans);
                return ;
            }
            if (k == n-2){
                if (y > 1){
                    vector<int> ans(n,0);
                    ans[n-2] = 1;
                    ans[n-1] = y;
                    say(ans);
                    return ;
                }
                else {
                    no();
                    return ;
                }
            }
            if (k == n-1){
                vector<int> ans(n,0);
                ans[n-1] = y;
                say(ans);
                return ;
            }
        }
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}