#include using namespace std; using ll = long long; const ll mod = 1e9 + 7; const int N = 200005; const int INF = 0x3f3f3f3f; int main() { int n, k, x, y; cin >> n >> k >> x >> y; if (!y) { cout << "No\n"; return 0; } if (k == 1) { int lst = x + n - 1; if (y < lst) { cout << "No\n"; } else { cout << "Yes\n"; for (int i = 0; i < n - 1; i++) cout << x + i << " "; cout << y << "\n"; } return 0; } vector ans(n, 1); ans[0] = x; if (k & 1) { ans[1] = 1; ans[2] = x ^ 1; if (ans[2] == 0) { ans[1] = 2; ans[2] = x ^ 2; } for (int i = 3; i < k; i++) ans[i] = 1; } else { ans[1] = x; for (int i = 2; i < k; i++) ans[i] = 1; } ans.back() = y; for (int i = k; i < n - 1; i++) ans[i] = ans[i - k]; if (!x) { if (k & 1) { if (n == k + 1) { for (int i = 1; i < n - 1; i++) ans[i] = 0; } else if (n >= k + 3) { for (int i = 1; i < k; i++) ans[i] = 1; ans[k] = 2; ans[k + 1] = 3; for (int i = k + 2; i < n - 1; i++) ans[i] = ans[i - k]; } else { if (y == 1) { cout << "No\n"; return 0; } else { for (int i = 1; i < n - 2; i++) ans[i] = 0; ans[n - 2] = 1; } } } else { if (n >= k + 3) { ans[1] = 1; for (int i = 2; i < n - 1; i++) ans[i] = 3; } else if (n == k + 2) { if (y == 1) { cout << "No\n"; return 0; } for (int i = 2; i < k; i++) ans[i] = 0; ans[k - 1] = 2; ans[k] = 3; } else { for (int i = 1; i < n - 1; i++) ans[i] = 0; } } } cout << "Yes\n"; for (auto x : ans) cout << x << " "; cout << "\n"; return 0; }