#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = 3.14159265359;
vector<long long> primes;
void GeneratingPrimes(int top) {
  vector<bool> p(top + 1, 1);
  p[0] = p[1] = 0;
  for (int i = 2; i <= sqrt(top); i++) {
    if (p[i]) {
      for (int j = i * i; j <= top; j += i) {
        p[j] = 0;
      }
    }
  }
  for (int i = 0; i < top + 1; i++)
    if (p[i]) primes.push_back(i);
}
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void EXTgcd(long long a, long long b, int& x0, int& y0) {
  if (b == 0) {
    x0 = 1, y0 = 0;
    return;
  }
  EXTgcd(b, a % b, x0, y0);
  long long x1 = y0;
  long long y1 = x0 - (a / b) * y0;
  x0 = x1;
  y0 = y1;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res % p;
}
double dist(double a, double b, double x, double y) {
  return sqrt(pow(a - x, 2) + pow(b - y, 2));
}
double dist3(double a, double b, double c, double x, double y, double z) {
  return sqrt(pow(a - x, 2) + pow(b - y, 2) + pow(c - z, 2));
}
int xadd[9] = {1, -1, 0, 1, -1, 0, 1, -1, 0};
int yadd[9] = {1, -1, 0, -1, 0, 1, 0, 1, -1};
long long const N = 100000 + 10;
long long mod = 998244353;
int a, b, c, d;
int main() {
  cin >> a >> b >> c >> d;
  vector<int> ans;
  if (!a && !b) {
    if (abs(c - d) > 1) {
      cout << "NO";
      return 0;
    }
    cout << "YES\n";
    if (c > d) {
      for (int i = 0; i < d; i++) cout << "2 3 ";
      cout << 2;
      return 0;
    }
    for (int i = 0; i < c; i++) cout << "3 2 ";
    if (d > c) cout << 3;
    return 0;
  }
  if (!c && !d) {
    if (abs(a - b) > 1) {
      cout << "NO";
      return 0;
    }
    cout << "YES\n";
    if (a > b) {
      for (int i = 0; i < b; i++) cout << "0 1 ";
      cout << 0;
      return 0;
    }
    for (int i = 0; i < a; i++) cout << "1 0 ";
    if (b > a) cout << 1;
    return 0;
  }
  c -= d;
  b -= a;
  if (c < 0 || b < 0 || abs(c - b) > 1) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  if (b > c) {
    cout << "1 ";
    b--;
  }
  for (int i = 0; i < a; i++) cout << "0 1 ";
  while (min(b--, c--)) {
    cout << "2 1 ";
  }
  for (int i = 0; i < d; i++) cout << "2 3 ";
  if (c > b) cout << 2;
  return 0;
}
