#include <bits/stdc++.h>
using namespace std;
const long long N = 2100000;
long long mod = 1e9 + 7;
int power(int a, int p) {
  int r = 1, y = a;
  while (p) {
    if (p & 1) r = (1LL * r * y) % mod;
    p >>= 1;
    y = (1LL * y * y) % mod;
  }
  return r;
}
int ans[N];
int ara[6];
int temp[6];
int n;
bool check() {
  for (int i = 1; i < n; i++)
    if (abs(ans[i] - ans[i - 1]) != 1) return 0;
  for (int i = 0; i < 4; i++)
    if (temp[i] != 0) return 0;
  return 1;
}
bool build(int i, int j) {
  for (int i = 0; i < 4; i++) temp[i] = ara[i];
  for (; i <= 3 && j < n; i++) {
    while (temp[i] > 0 && j < n) {
      ans[j] = i;
      j++;
      temp[i]--;
      if (j == n || temp[i] == 0) break;
      ans[j] = i + 1;
      j++;
      temp[i + 1]--;
    }
  }
  return check();
}
int main() {
  for (int i = 0; i < 4; i++) cin >> ara[i];
  n = ara[0] + ara[1] + ara[2] + ara[3];
  bool ok = 0;
  for (int i = 0; i < 4; i++) {
    ok = build(i, 0);
    if (ok) break;
    ara[i + 1]--;
    ans[0] = i + 1;
    ok = build(i, 1);
    if (ok) break;
    ok = build(i + 2, 1);
    ara[i + 1]++;
    if (ok) break;
  }
  if (ok) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) cout << ans[i] << " ";
    cout << endl;
  } else
    cout << "NO" << endl;
}
