#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int main() {
  long long a, b, c, d;
  cin >> a >> b >> c >> d;
  a *= 2, b *= 2, c *= 2;
  if ((d < a) && (d < b) && (d <= c)) {
    if (d < c / 2)
      c /= 2;
    else
      c = d;
    if ((2 * d >= c)) {
      if (2 * d < b) {
        cout << a << "\n" << b << "\n" << c;
      } else {
        cout << -1;
      }
    } else {
      cout << -1;
    }
  } else {
    cout << -1;
  }
  return 0;
}
