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 2*a* ≥ *b*.

You are given sizes of bears and Masha. Find out some possible integer non-negative sizes of cars.
You are given four integers *V*<sub class="lower-index">1</sub>, *V*<sub class="lower-index">2</sub>, *V*<sub class="lower-index">3</sub>, *V*<sub class="lower-index">*m*</sub>(1 ≤ *V*<sub class="lower-index">*i*</sub> ≤ 100) — sizes of father bear, mother bear, son bear and Masha, respectively. It's guaranteed that *V*<sub class="lower-index">1</sub> &gt; *V*<sub class="lower-index">2</sub> &gt; *V*<sub class="lower-index">3</sub>.
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.
50 30 10 10
50
30
10
100 50 10 21
-1
100 50 19 10
100
50
19
99 50 25 49
100
99
49
3 2 1 1
4
3
1
100 99 98 100
-1
100 40 30 40
-1
100 50 19 25
100
51
25
100 50 19 30
100
61
30
49 48 25 49
-1
48 47 23 46
94
93
46
37 23 16 20
42
41
20
98 2 1 1
98
3
1
99 22 13 14
99
29
14
97 95 3 2
97
95
3
27 3 2 3
-1
13 7 6 2
-1
19 17 11 6
19
17
11
15 6 4 5
15
11
5
21 3 1 3
-1
100 99 98 97
196
195
98
99 32 13 5
-1
5 4 3 1
-1
50 20 4 8
50
20
8
60 30 10 1
-1
100 50 10 1
-1
40 30 20 10
40
30
20
50 49 5 10
50
49
10
99 98 50 97
196
195
97
50 30 10 5
50
30
10
4 3 2 1
4
3
2
100 50 3 1
-1
string = [int(n) for n in input().split()]
arr = []
for s in range(len(string)):
    x = 0
    for i in string[s + 1:]:
        if string[s] >= i:
            x += 1
    if x == len(string) - 1 - s:
        arr += [string[s]]

if len(arr) == 4:
    for s in arr[:len(arr) - 1]:
        print(s)
else:
    print(-1)
