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)

x=[]
n=10
for i in 0..(n-1)
  print "山の高さ"+(i+1).to_s+"(整数)>"
  x[i]=gets.chomp.to_i
end
max=0
num=0
for i in 0..(n-1)
  if x[i]>=0 && x[i]<=10000
    max=x[i]
    num=i
    break
  end
end
for i in num..(n-1)
  if x[i] > max && x[i]>=0 && x[i]<=10000
    max = x[i]
  end
end
puts "最も高い山の高さ="+ max.to_s
max2=0
for i in num..(n-1)
  if x[i]<max && x[i]>max2 && x[i]>=0 && x[i]<=10000
    max2 = x[i]
  end
end
puts "2番目に高い山の高さ=" + max2.to_s
max3=0
for i in num..(n-1)
  if x[i]<max2 && x[i]>max3 && x[i]>=0 && x[i]<=10000
    max3=x[i]
  end
end
puts "3番目に高い山の高さ=" + max3.to_s