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)

 def sort_bubble(a)
 	n = a.size
	n = n -1
	 
	for i in 0..n
		for j in 0..n - i -1
			if a[j] > a[j+1]
				tmp = a[j]
				a[j] = a[j+1]
				a[j+1] = tmp
			end
		end
	end
	
	return a
	
end

 a = [0,0,0,0,0,0,0,0,0,0]
 
for num in 0..9 do
 
	a[num] = gets.chomp
 
end
 
 a = sort_bubble(a)

puts a[9]
puts a[8]
puts a[7]