#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
int a[4];
void bad() {
  cout << "NO";
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (int i = 0; i < 4; i++) cin >> a[i];
  int cnt = 0;
  for (int i = 0; i < 4; i++)
    if (a[i] > 0) cnt++;
  if (cnt == 1) {
    int mx = 0;
    for (int i = 0; i < 4; i++) mx = max(mx, a[i]);
    if (mx > 1) bad();
    cout << "YES\n";
    for (int i = 0; i < 4; i++)
      if (a[i] > 0) cout << i << " ";
  } else if (cnt == 2) {
    int num1 = -1, num2 = -1;
    for (int i = 0; i < 4; i++)
      if (a[i] > 0) {
        if (num1 == -1)
          num1 = i;
        else
          num2 = i;
      }
    if (num2 != num1 + 1) bad();
    if (abs(a[num2] - a[num1]) > 1) bad();
    cout << "YES\n";
    if (a[num2] == a[num1]) {
      for (int i = 0; i < a[num2]; i++) cout << num1 << " " << num2 << " ";
    } else {
      if (a[num1] < a[num2]) swap(num1, num2);
      for (int i = 0; i < a[num2]; i++) cout << num1 << " " << num2 << " ";
      cout << num1;
    }
  } else {
    if (a[0] > a[1]) bad();
    if (a[3] > a[2]) bad();
    vector<int> revPre, suf, mid;
    for (int i = 0; i < a[0]; i++) {
      revPre.push_back(1), revPre.push_back(0);
    }
    for (int i = 0; i < a[3]; i++) {
      suf.push_back(2), suf.push_back(3);
    }
    a[1] -= a[0], a[2] -= a[3];
    if (a[1] == a[2]) {
      for (int i = 0; i < a[1]; i++) mid.push_back(2), mid.push_back(1);
    } else if (a[1] + 1 == a[2]) {
      for (int i = 0; i < a[1]; i++) mid.push_back(2), mid.push_back(1);
      suf.push_back(2);
    } else if (a[1] - 1 == a[2]) {
      for (int i = 0; i < a[2]; i++) mid.push_back(2), mid.push_back(1);
      revPre.push_back(1);
    } else {
      bad();
    }
    cout << "YES\n";
    reverse(revPre.begin(), revPre.end());
    for (auto i : revPre) cout << i << " ";
    for (auto i : mid) cout << i << " ";
    for (auto i : suf) cout << i << " ";
  }
  return 0;
}
