Problem:
List of Top 3 Hills

There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.

Write a program which prints heights of the top three mountains in descending order.

Input

Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10

Constraints

0 ≤ height of mountain (integer) ≤ 10,000

Output

Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain

Sample Input 1

1819
2003
876
2840
1723
1673
3776
2848
1592
922

Output for the Sample Input 1

3776
2848
2840

Sample Input 2

100
200
300
400
500
600
700
800
900
900

Output for the Sample Input 2

900
900
800

Solution in Ruby (judge verdict: Wrong Answer)

man = []
max = 0
max2 = 0
max3 = 0

10.times do |i|
man[i] = gets.to_i	
end

10.times do |i|
    if max < man[i] then
       max = man[i]
    end
end
    
10.times do |i|
    if max > man[i] && max2 < man[i]  then
       max2 = man[i]
    end
end
 
10.times do |i|
    if max2 > man[i] && max3 < man[i]  then
       max3 = man[i]
    end
end


    puts max
    puts max2
    puts max3