#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
void bad(string mes = "NO") {
  cout << mes;
  exit(0);
}
void bad(int mes) {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
mt19937_64 mt_rand(chrono::system_clock::now().time_since_epoch().count());
template <typename T1, typename T2>
inline bool upmax(T1& a, T2 b) {
  return (a < b ? (a = b, true) : false);
}
template <typename T1, typename T2>
inline bool upmin(T1& a, T2 b) {
  return (b < a ? (a = b, true) : false);
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)2e5 + 3, base = 998244353;
const long long llinf = 2e18 + 5;
int binpow(int a, int second) {
  int res = 1;
  while (second) {
    if (second % 2) {
      res = 1ll * res * a % base;
    }
    a = 1ll * a * a % base;
    second /= 2;
  }
  return res;
}
void solve() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  vector<int> p1, p2;
  bool okl = false;
  while (a > 0) {
    p1.push_back(0);
    a--;
    if (a != 0) {
      p1.push_back(1);
      b--;
    } else {
      if (b > 0) {
        p1.push_back(1);
        b--;
        okl = true;
      }
    }
  }
  if (b < 0) {
    bad();
  }
  bool okr = false;
  while (d > 0) {
    p2.push_back(3);
    d--;
    if (d != 0) {
      p2.push_back(2);
      c--;
    } else {
      if (c > 0) {
        p2.push_back(2);
        c--;
        okr = true;
      }
    }
  }
  if (c < 0) {
    bad();
  }
  reverse((p2).begin(), (p2).end());
  if (p1.size() && p2.size() && (!okl || !okr)) {
    bad();
  }
  if (b > c && p1.size()) {
    p1.insert(p1.begin(), 1);
    b--;
  }
  if (c > b && p2.size()) {
    p2.push_back(2);
    c--;
  }
  if (b != c) {
    if (c == b + 1 && p2.empty() && (okl || p1.empty())) {
      for (int i = 0; i < b; i++) {
        p1.push_back(2);
        p1.push_back(1);
      }
      c -= b;
      b = 0;
      p1.push_back(2);
      c--;
    } else if (b == c + 1 && p1.empty() && (okr || p2.empty())) {
      for (int i = 0; i < c; i++) {
        p1.push_back(1);
        p1.push_back(2);
      }
      b -= c;
      c = 0;
      p1.push_back(1);
      b--;
    } else {
      bad();
    }
  } else {
    for (int i = 0; i < b; i++) {
      p1.push_back(2);
      p1.push_back(1);
    }
    b = 0;
    c = 0;
  }
  cout << "YES\n";
  for (auto e : p1) {
    cout << e << ' ';
  }
  for (auto e : p2) {
    cout << e << ' ';
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
