#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
long double pi = 3.1415926535897932384626433832795;
long long mod = 1e9 + 7;
const int N = 3e5 + 10;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long bin_pow(long long n, long long p) {
  long long res = 1, a = n;
  while (p) {
    if (p & 1) res *= a, res %= mod;
    a *= a;
    a %= mod;
    p >>= 1;
  }
  return res;
}
long long _gcd(long long a, long long b, long long& x, long long& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long d = _gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
int n, a[N];
int main() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  for (int i = a; i <= a * 2; i++) {
    for (int j = b; j <= b * 2; j++) {
      for (int k = c; k <= c * 2; k++) {
        bool ok = 1;
        ok &= k >= d;
        ok &= k <= 2 * d;
        ok &= k * 2 < j;
        ok &= i > j;
        ok &= j > k;
        if (ok) {
          cout << i << endl << j << endl << k;
          return 0;
        }
      }
    }
  }
  cout << -1;
  return 0;
}
