Codeforces Round #454 A. Masha and Bears

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 10 + 7, maxd = 1e8;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n;
int a, b, c, d;

int main() {
    cin >> a >> b >> c >> d;
    int t1 = -1, t2 = -1, t3 = -1;
    for(int i = c; i <= 2*c; ++i) {
        if(i >= d && i <= 2*d) {
            t1 = i;
            break;
        }
    }
    if(t1 == -1) return puts("-1") * 0;

    for(int i = max(t1+1, b); i <= 2*b; ++i ) {
        if(i > 2*d) {
            t2 = i;
            break;
        }
    }
    if(t2 == -1) return puts("-1") * 0;

    for(int i =  max(t2+1, a); i <= 2*a; ++i ) {
        if(i > 2*d) {
            t3 = i;
            break;
        }
    }
    if(t3 == -1) return puts("-1") * 0;

    cout << t3 << endl << t2 << endl << t1;

    return 0;
}