#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
int main() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  int n = a + b + c + d;
  int p[n];
  int a1, b1, c1, d1;
  int a2 = a, b2 = b, c2 = c, d2 = d;
  if (a + c > b + d) {
    a1 = 0;
    b1 = 1;
    c1 = 2;
    d1 = 3;
  } else {
    a1 = 3;
    b1 = 2;
    c1 = 1;
    d1 = 0;
    a = d2;
    b = c2;
    c = b2;
    d = a2;
  }
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      if (a >= i / 2 + 1)
        p[i] = a1;
      else if ((a + c) >= i / 2 + 1)
        p[i] = c1;
      else
        p[i] = 5;
    } else {
      if (b >= (i + 1) / 2)
        p[i] = b1;
      else if ((b + d) >= (i + 1) / 2)
        p[i] = d1;
      else
        p[i] = 5;
    }
  }
  int t = 0;
  for (int i = 1; i < n && t < 1; i++) {
    int x = p[i] > p[i - 1] ? (p[i] - p[i - 1]) : (p[i - 1] - p[i]);
    if (x != 1) t++;
  }
  if (t > 0)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) cout << p[i] << " ";
    cout << endl;
  }
  return 0;
}
