#include <bits/stdc++.h>
using namespace std;
vector<int> w(4), ans;
void solve(int cur) {
  ans.clear();
  vector<int> c = w;
  while (c[cur] && cur < 4) {
    c[cur]--;
    ans.emplace_back(cur);
    cur += (cur && c[cur - 1] ? -1 : 1);
  }
  if (*max_element(c.begin(), c.end()) == 0) {
    puts("YES");
    for (auto e : ans) printf("%d ", e);
    exit(0);
  }
}
int main() {
  for (int i = 0; i < 4; i++) cin >> w[i];
  for (int i = 0; i < 4; i++) solve(i);
  puts("NO");
  return 0;
}
