CodeForce 907 A. Masha and Bears

最新推荐文章于 2022-09-27 02:43:28 发布

原创最新推荐文章于 2022-09-27 02:43:28 发布 · 1.0k 阅读

0 ·

CC 4.0 BY-SA版权

日常同时被 2 个专栏收录

88 篇文章

订阅专栏

思维

20 篇文章

订阅专栏

在这款趣味挑战中，Masha需要找到适合三只熊的汽车尺寸。每只熊只能进入特定大小的汽车，并且Masha仅喜爱最小的那辆。任务是根据给定的熊和Masha的尺寸，找出符合要求的汽车尺寸。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb into the largest car and he likes it. Also, mother bear can climb into the middle car and she likes it. Moreover, son bear can climb into the smallest car and he likes it. It's known that the largest car is strictly larger than the middle car, and the middle car is strictly larger than the smallest car.

Masha came to test these cars. She could climb into all cars, but she liked only the smallest car.

It's known that a character with size a can climb into some car with size b if and only if a ≤ b, he or she likes it if and only if he can climb into this car and 2a ≥ b.

You are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.

Input

You are given four integers V1, V2, V3, Vm(1 ≤ Vi ≤ 100) — sizes of father bear, mother bear, son bear and Masha, respectively. It's guaranteed that V1 > V2 > V3.

Output

Output three integers — sizes of father bear's car, mother bear's car and son bear's car, respectively.

If there are multiple possible solutions, print any.

If there is no solution, print "-1" (without quotes).

Examples

input
50 30 10 10

output
50
30
10

input
100 50 10 21

output
-1

Note

In first test case all conditions for cars' sizes are satisfied.

In second test case there is no answer, because Masha should be able to climb into smallest car (so size of smallest car in not less than 21), but son bear should like it, so maximum possible size of it is 20.

注意 Masha只喜欢最小的车，也就是说他不喜欢大车和中车

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c,d;
    while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)
    {
        if(d>2*c||d>=b||c>2*d)
            printf("-1\n");
        else
        {
            printf("%d\n%d\n%d\n",2*a,2*b,max(c,d));
        }
    }
    return 0;
}