#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;

int main() {
    ll n, k, x, y;
    cin >> n >> k >> x >> y;
    if (!y) {
        cout << "No\n";
        return 0;
    }
    if (k == 1) {
        if (y - x < n - 1) {
            cout << "No\n";
            return 0;
        }
        cout << "Yes\n";
        ll tot = y - x;
        vector<ll> res(n);
        res[0] = x;
        for (int i = 1; i < n - 1; i++) {
            res[i] = res[i - 1] + 1;
            tot--;
        }
        res[n - 1] = res[n - 2] + tot;
        for (auto x : res) cout << x << " ";
        cout << "\n";
        return 0;
    }
    cout << "Yes\n";
    vector<ll> res(n);
    res[0] = x;
    if (n >= 2) res[1] = 0;
    for (int i = 2; i < n - 1; i++) res[i] = ((i + 1) & 1) ? (1ll << 19) : ((1ll << 19) + 1);
    res[n - 1] = y;
    for (auto x : res) cout << x << " ";
    cout << "\n";
    return 0;
}