#include <bits/stdc++.h>
using namespace std;

using ll = long long;

template <class _ForwardIterator>
void print(_ForwardIterator first, _ForwardIterator last)
{
    bool f = true;
    for (auto it = first; it != last; ++it)
    {
        if (!f)
        {
            cout << " ";
        }
        cout << *it;
        f = false;
    }

    cout << endl;
}

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N, K;
    cin >> N >> K;
    ll X, Y;
    cin >> X >> Y;
    if (X == 0 && K >= 2 && K % 2 == 1)
    {
        vector<ll> A(N);
        A[1] = 1;
        for (int i = 2; i < N - 1; i++)
        {
            int pos = (i - 2) % K;
            if (pos >= K - 2)
            {
                A[i] = pos - (K - 4);
            }
            else
            {
                A[i] = 1;
            }
        }
        A[N - 1] = Y;
        cout << "Yes" << endl;
        print(A.begin(), A.end());
    }
    else
    {
        assert(X < 0);
    }
}