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



Sample input:
1819
2003
876
2840
1723
1673
3776
2848
1592
922


Sample output:
3776
2848
2840

Submission status: Wrong Answer

Solution code:
h=sorted([int(input())for _ in range(10)])
print(h[9:6:-1],sep='\n')

Submission status: Wrong Answer

Solution code:
N = 10
mnts = []

for i in range(N):
    mnts.append(int(input()))

mnts.sort(reverse=True)
print(mnts)

for mnt in mnts[:3]:
    print(mnt)

Submission status: Wrong Answer

Solution code:
num = 3
mountains = list(map(int, input()))
mountains = sorted(mountains, reverse=True)
for i in range(num):
    print(mountains[i])

Submission status: Wrong Answer

Solution code:
num = 10
top = 3
mountains = [input() for i in range(num)]
mountains = sorted(mountains, reverse=True)
for i in range(top):
    print(mountains[i])

Submission status: Wrong Answer

Solution code:
a = []
for i in range(10):
    n = int(input())
    a.append(n)

a.sort()

for i in range(3):
    print(a[i])

Submission status: Wrong Answer

Solution code:
a = []
for i in range(10):
   n = int(input())
   a.append(n)
a = [1,3,5,6,8,11,12,14,15,17]
a.sort(reverse=True)

for i in range(3):
    print(a[i])

Submission status: Wrong Answer

Solution code:
a = []
for i in range(10):
    n = int(input())
    a.append(n)

print(*sorted(a, reverse=True)[:3],sep = '¥n')

Submission status: Wrong Answer

Solution code:
data = []
for i in range(0,10):
    data.append(input())

print()

data.sort()
data.reverse()
for i in range(3):
    print(data[i])

Submission status: Wrong Answer

Solution code:
hills = [input() for _ in range(10)]
hills = list(map(int, hills))
hills.sort

for i in range(3):
    print(hills.pop())

Submission status: Wrong Answer

Solution code:
m = [int(input()) for _ in range(10)]
m.sort()
[print(m[-i] for i in range(1, 4))]

Submission status: Wrong Answer

Solution code:
def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j], end="")

Submission status: Wrong Answer

Solution code:
def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j])

Submission status: Wrong Answer

Solution code:
def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j])

Submission status: Wrong Answer

Solution code:
#coding:UTF-8

l = []
first = 0
second = 0
third = 0
for num in range(10):
    x = int(input())
    if x >  first:
        third = second
        second = first
        first = x
    elif x > second:
        third = second
        second = x
    elif x > third:
        thied = x
print(first)
print(second)
print(third)

Submission status: Wrong Answer

Solution code:
#coding:UTF-8

first = 0
second = 0
third = 0
for num in range(10):
    x = int(input())
    if x >  first:
        third = second
        second = first
        first = x
    elif x > second:
        third = second
        second = x
    elif x > third:
        thied = x
print(first)
print(second)
print(third)

Submission status: Wrong Answer

Solution code:
first = 0;
second = 0;
third = 0;
for var in range(0,9):
	N = input()
	if N>=first:
		third = second
		second = first
		first = N
	elif N>=second:
		third = second
		second = N
	elif N>=third:
		third = N

print first
print second
print third

Submission status: Wrong Answer

Solution code:
first = 0;
second = 0;
third = 0;
for var in range(0,9):
	N = input()
	if N>=first:
		third = second
		second = first
		first = N
	elif N>=second:
		third = second
		second = N
	elif N>=third:
		third = N
print first
print second
print third

Submission status: Wrong Answer

Solution code:
first = 0;
second = 0;
third = 0;
for var in range(0,9):
	N = input()
	if N>first:
		third = second
		second = first
		first = N
	elif N>second:
		third = second
		second = N
	elif N>third:
		third = N
print first
print second
print third

Submission status: Wrong Answer

Solution code:
"\n".join([str(x) for x in (sorted([input() for i in range(10)])[:-3:-1])])

Submission status: Wrong Answer

Solution code:
print '\n'.join([str(x) for x in sorted(input() for i in range(10))])

Submission status: Wrong Answer

Solution code:
def aizu_vol_0_001():
    height_mountain_lst = []
    for i in range(10):
        height_mountain = int(raw_input())
        if height_mountain <= 10000 and height_mountain >= 0:
            height_mountain_lst.append(height_mountain)

    height_mountain_lst.sort(reverse = True)
    print height_mountain_lst[0]
    print height_mountain_lst[1]
    print height_mountain_lst[2]

Submission status: Wrong Answer

Solution code:
l = [];
for i in range(10):
    l.append(int(raw_input().strip()))
l.sort();
for a in l[:3]:
    print a

Submission status: Wrong Answer

Solution code:
print sorted(map(lambda x:input(), range(10)), lambda x, y: y - x)[:3]

Submission status: Wrong Answer

Solution code:
list = []
for x in range(10):
    y=input()
    list.append(y)
list = sorted(list)
list.reverse()
print list[:3]

Submission status: Wrong Answer

Solution code:
xs = [input() for _ in xrange(3)]
xs.sort()
for x in xs[:3]:
    print x

Submission status: Wrong Answer

Solution code:
data = (1819, 2003, 876, 2840, 1723,
        1673, 3776, 2848, 1592, 922)

m1 = m2 = m3 = 0 

for i in data:
    if m1 < i < 10000:
        m3 = m2
        m2 = m1
        m1 = i 
    elif m2 < i < m1: 
        m3 = m2
        m2 = i 
    elif m3 < i < m2: 
        m3 = i 

print m1
print m2
print m3

Submission status: Wrong Answer

Solution code:
data = []
for i in range(10):
    data.append(int(raw_input()))

m1 = m2 = m3 = 0 
for i in data:
    if m1 < i < 10000:
        m3 = m2
        m2 = m1
        m1 = i 
    elif m2 < i < m1: 
        m3 = m2
        m2 = i 
    elif m3 < i < m2: 
        m3 = i

print m1
print m2
print m3

Submission status: Wrong Answer

Solution code:
data = []
for i in range(10):
    data.append(int(raw_input("0 < num < 10000 : ")))

m1 = m2 = m3 = 0 
for i in data:
    if m1 <=  i <= 10000:
        m3 = m2
        m2 = m1
        m1 = i 
    elif m2 < i < m1: 
        m3 = m2
        m2 = i 
    elif m3 < i < m2: 
        m3 = i

print m1
print m2
print m3

Submission status: Wrong Answer

Solution code:
data = []
for i in range(10):
    data.append(int(raw_input()))

m1 = m2 = m3 = 0 
for i in data:
    if m1 <=  i <= 10000:
        m3 = m2
        m2 = m1
        m1 = i 
    elif m2 < i < m1: 
        m3 = m2
        m2 = i 
    elif m3 < i < m2: 
        m3 = i

print m1
print m2
print m3

Submission status: Wrong Answer

Solution code:
data = []
for i in range(10):
    data.append(int(raw_input()))

m1 = m2 = m3 = 0 
for i in data:
    if m1 <= i <= 10000:
        m3 = m2
        m2 = m1
        m1 = i 
    elif m2 < i < m1: 
        m3 = m2
        m2 = i 
    elif m3 < i < m2: 
        m3 = i 

print "{}\n{}\n{}".format(m1, m2, m3)

Submission status: Wrong Answer

Solution code:
data = []
for i in range(10):
    data.append(int(raw_input()))

m1 = m2 = m3 = 0 
for i in data:
    if 0 <= i <= 10000:
        if m1 <= i:
            m3 = m2
            m2 = m1
            m1 = i 
        elif m2 < i < m1: 
            m3 = m2
            m2 = i 
        elif m3 < i < m2: 
            m3 = i 

print "{}\n{}\n{}".format(m1, m2, m3)

Submission status: Wrong Answer

Solution code:
lis = []
for i in xrange(10):
 lis.append(input())
for a in sorted(lis)[:3]:
 print a

Submission status: Wrong Answer

Solution code:
print "\n".join(map(str,sorted([input() for x in xrange(10)])[:3]))

Submission status: Wrong Answer

Solution code:
from sys import stdin

x = [int(input()) for i in range(10)]
x.reverse()
for i in range(3):
    print(i)

Submission status: Wrong Answer

Solution code:
from sys import stdin

x = [int(input()) for i in range(10)]
x.sort(reverse=True)
for i in range(3):
    print(i)

Submission status: Wrong Answer

Solution code:
for num in sorted([raw_input() for i in range(10)])[-1: -4: -1]:
	print num

Submission status: Wrong Answer

Solution code:
#coding: UTF-8

num = []

for i in range(10):
	num.append(input())

num.sort()

print num[-3]
print num[-2]
print num[-1]

Submission status: Wrong Answer

Solution code:
fir=0
sec=0
thi=0

a=input()
if a > fir:
        fir = a
else:
        if a > sec:
                sec = a
        else:
                if a > thi:
                        thi = a

print fir
print sec
print thi

Submission status: Wrong Answer

Solution code:
fir=0
sec=0
thi=0

for a in range(0,10):
        a=input()
        if a > fir:
                fir = a
        else:
                if a > sec:
                        sec = a
                else:
                        if a > thi:
                                thi = a

print fir
print sec
print thi

Submission status: Wrong Answer

Solution code:
fir=0
sec=0
thi=0

for a in range(0,10):
        a=input()
        if a > fir:
                sec = fir
                fir = a
        else:
                if a > sec:
                        thi = sec
                        sec = a
                else:
                        if a > thi:
                                thi = a

print fir
print sec
print thi

Submission status: Wrong Answer

Solution code:
fir=0
sec=0 
thi=0   
        
for a in range(0,10): 
        a=input()
        if a >= fir:
                sec = fir
                fir = a 
        else:           
                if a >= sec:
                        thi = sec
                        sec = a 
                else:
                        if a >= thi:
                                thi = a

print fir
print sec
print thi

Submission status: Wrong Answer

Solution code:
fir=0
sec=0
thi=0

for a in range(0,10):
        a=input()
        if a >= fir:
                sec = fir
                fir = a
        elif a >= sec:
                thi = sec
                sec = a
        elif a >= thi:
                thi = a

print fir
print sec
print thi

Submission status: Wrong Answer

Solution code:
fir=0
sec=0
thi=0

for a in range(0,10):
        a=input()
        if a >= fir:
                sec = fir
                thi = sec
                fir = a
        elif a >= sec:
                thi = sec
                sec = a
        elif a >= thi:
                thi = a

print fir
print sec
print thi

Submission status: Wrong Answer

Solution code:
import sys
heights = []
for line in sys.stdin:
    heights.append(int(line.rstrip('\n')))
for height in sorted(heights)[:3]:
    print height

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

def lot3h():
    mounts = []
    for i in range(10):
        mounts.append(int(raw_input()))
    mounts.sort()
    mounts.reverse()
    for i in range(10):
        print "%d\n" % mounts[i] ,
    return

if __name__ == "__main__":
    lot3h()

Submission status: Wrong Answer

Solution code:
x = []
for i in range(3):
	x.append(input())
x.sort()
for j in range(-1,-4,-1):
	print(x[j])

Submission status: Wrong Answer

Solution code:
import sys
for i in sorted(map(int,sys.stdin)[1:])[:-4:-1]:print i

Submission status: Wrong Answer

Solution code:
heights = []
for n in range(10):
  heights.append(int(raw_input()))
heights = sorted(heights)[::-1]
for h in heights:
  print h

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python

import sys

array = [0 for i in range(10)]

for i in range(10):
  array[i] = raw_input()

for j in range(3):
  print max(array) + "\n"
  array.remove(max(array))

sys.exit()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python

import sys

array = [0 for i in range(10)]

for i in range(10):
  array[i] = raw_input()

array.sort()

for j in range(3):
  print array[j] + "\n"

sys.exit()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python

import sys

array = [0 for i in range(10)]

for i in range(10):
  array[i] = raw_input()

array.sort()
array.reverse()

for j in range(3):
  print array[j] + "\n"

sys.exit()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python

import sys

array = [0 for i in range(10)]

for i in range(10):
  array[i] = raw_input()

array.sort()
array.reverse()

for j in range(3):
  print str(array[j]) + "\n"

sys.exit()

Submission status: Wrong Answer

Solution code:
import sys

array = [0 for i in range(10)]

for i in range(10):
  array[i] = raw_input()

array.sort()
array.reverse()

for j in range(3):
  print str(array[j])

sys.exit()

Submission status: Wrong Answer

Solution code:
a = []
for i in range(10):
    a.append(input())
print a
for i in range(len(a)):
    for s in range(i+1,len(a)):
        if a[i] < a[s]:
            tmp = a[s]
            a[s] = a[i]
            a[i] = tmp


for i in range(3):
    print a[i]

Submission status: Wrong Answer

Solution code:
a = []
for item in range(10):
    a.append(input())
a.sort()
min1 = a[0]
min2 = a[1]
min3 = a[2]

print min1
print min2
print min3

Submission status: Wrong Answer

Solution code:
a = [int(raw_input()) for i in xrange(10)]
a.sort
a.reverse
print a[0]
print a[1]
print a[2]

Submission status: Wrong Answer

Solution code:
s = []
for i in xrange(10):
	s.append(raw_input())
s.sort()
for i in xrange(9,7,-1):
	print s[i]

Submission status: Wrong Answer

Solution code:
m=[1819,2003,876,2840,1723,1673,3776,2848,1592,922]
m.sort()
m.reverse()
print m[0:2]

Submission status: Wrong Answer

Solution code:
m=[1819,2003,876,2840,1723,1673,3776,2848,1592,922]
m.sort()
m.reverse()
print m[:3]

Submission status: Wrong Answer

Solution code:
m=[1819,2003,876,2840,1723,1673,3776,2848,1592,922]
m.sort()
m.reverse()
for i in range(3):
	print m.pop(i)

Submission status: Wrong Answer

Solution code:
m=[1819,2003,876,2840,1723,1673,3776,2848,1592,922]
m.sort()
m.reverse()
for i in range(0,3):
	print m[i]

Submission status: Wrong Answer

Solution code:
#m=[1819,2003,876,2840,1723,1673,3776,2848,1592,922]
m=[]
for i in range(10):
	x = input()
	m.append(x)
m.sort()
m.reverse()
for i in range(0,3):
	print m

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

def qsort( a ):
	if not isinstance(a,list):
		raise TypeError('qsort can only sort \'list\'')
	if len(a) <= 1:
		return a
	p = a[0]
	for i in range(1,len(a)):
		if a[0] != a[i]:
			p = a[i]
			break
		elif i == len(a)-1:
			#all are same
			return a

	while True:
		i = 0
		j = len(a)
		for i in range( 0, len(a) ):
			if p <= a[i]:
				break
		for j in range( len(a)-1, -1, -1 ):
			if a[j] < p:
				break
		if i > j:
			a1 = qsort( a[:i] )
			a2 = qsort( a[i:] )
			a1.extend(a2)
			return a1
		else:
			tmp  = a[i]
			a[i] = a[j]
			a[j] = tmp

if __name__ == '__main__':
	m_list = []
	for i in range(0,10):
		m_list.append( int( sys.stdin.readline() ) )
	s = qsort(m_list)
	s.reverse()
	for i in range(0,3):
		print('{}'.format(s[i]))

Submission status: Accepted

Solution code:
m1=m2=m3=0
for i in range(10):
    m3=max(m3,int(input()))
    if m3>m2:m2,m3=m3,m2
    if m2>m1:m1,m2=m2,m1
print(m1)
print(m2)
print(m3)

Submission status: Accepted

Solution code:
s = [int(input()) for i in range(10)]
s.sort(reverse = True)
for i in s[:3]:
    print(i)

Submission status: Accepted

Solution code:
A = [int(input()) for i in range(10)]
for i in sorted(A)[:-4:-1]:
    print(i)

Submission status: Accepted

Solution code:
mount_list = []

for i in range(10):
  mount_list.append(int(input()))

mount_list.sort(reverse = True)

for i in range(3):
  print(mount_list[i])

Submission status: Accepted

Solution code:
moutain = [0 for i in range(10)]
for i in range(10):
    moutain[i] = int(raw_input())
moutain.sort(reverse=True)
for i in range(3):
    print moutain[i]

Submission status: Accepted

Solution code:
num = [int(input()) for i in range(10)]
num.sort(reverse=True)
for i in range(3):
    print(num[i])

Submission status: Accepted

Solution code:

a = []

while True:
    try:
        n = int(input())
        a.append(n)
    except:
        break

print(max(a))
a.remove(max(a))
print(max(a))
a.remove(max(a))
print(max(a))

Submission status: Accepted

Solution code:
l = []
for i in range(10):
    l.append(int(input()))
l.sort()
for i in range(3):
    print(l[9-i])

Submission status: Accepted

Solution code:
def __main():

    mountains = []
    numOfMoun = 10
 
    for c in range(numOfMoun):
        mountains.insert(c,int(input()))
        
    sorted_mounts = sorted(mountains,reverse=True)
    for k in range(3):
        print(sorted_mounts[k])

__main()

Submission status: Accepted

Solution code:
h=[]
for i in range(10):
    h.append((int)(input()))
h.sort()
h.reverse()
for i in range(3):
    print(h[i])

Submission status: Accepted

Solution code:
h=sorted([int(input()) for _ in range(10)])[::-1]
for i in h[0:3]:
    print(i)

Submission status: Accepted

Solution code:
mh=[]

for i in range(1,11):
    mh.append(int(input()))

mh.sort(reverse=True)
print(mh[0])
print(mh[1])
print(mh[2])

Submission status: Accepted

Solution code:
a_list = []
for i in range(10):
    while True:
        a = input()
        a = int(a)
        if 0<=a and a<=10000:break
    a_list.append(a)

for i in range(3):
    print(max(a_list))
    a_list.remove(max(a_list))

Submission status: Accepted

Solution code:
mountains = []

for _ in range(10):
    mountains.append(int(input()))

mountains.sort(reverse=True)

for height in mountains[:3]:
    print(height)

Submission status: Accepted

Solution code:
Height = [0]*10

for i in range (10):
    Height[i] = int(input())
Height.sort()
Height.reverse()
for j in range(3):
    print(Height[j])

Submission status: Accepted

Solution code:

arr = list([])

for i in range(10):
    arr.append(int(input()))

arr.sort(reverse=True)

for i in range(3):
    print arr[i]

Submission status: Accepted

Solution code:
arr = list([input() for _ in range(10)])
  
arr.sort(reverse=True)
 
for i in range(3):
    print arr[i]

Submission status: Accepted

Solution code:
i = 0
x = []
for i in range(10):
    mount = int(input())
    x.append(mount)
sorted_x = sorted(x)
print(sorted_x[-1])
print(sorted_x[-2])
print(sorted_x[-3])

Submission status: Accepted

Solution code:
m=[]
for i in range(10):m.append(int(input()))
m.sort(reverse=True)
for i in range(3):print(m[i])

Submission status: Accepted

Solution code:
mountains = []

for i in range(10):
    m = int(input())
    mountains.append(m)

mountains.sort(reverse=True)

for i in range(3):
    print(mountains[i])

Submission status: Accepted

Solution code:
max = [0,0,0]
for a in range(10):
    s = int(input())
    if max[0] < s:
        max[2] = max[1]
        max[1] = max[0]
        max[0] = s
    elif max[1] < s:
        max[2] = max[1]
        max[1] = s
    elif max[2] < s:
        max[2] = s
for a in max:
    print(a)

Submission status: Accepted

Solution code:
hs=[int(input()) for i in range(10)]
h=sorted(hs,reverse=True)
for i in range(3):
  print(h[i])

Submission status: Accepted

Solution code:
heights = [int(input()) for i in range(0, 10)]
heights.sort(reverse=True)
for height in heights[:3]:
    print(height)

Submission status: Accepted

Solution code:
# Python 3+
#-------------------------------------------------------------------------------
import sys

#ff = open("test.txt", "r")
ff = sys.stdin

arr = [ int(x) for x in ff.readlines() ]

arr.sort(reverse=True)

for x in arr[0:3] : print(x)

Submission status: Accepted

Solution code:
list = []
for i in range(10):
    n = int(input())
    list.append(n)
list.sort()
print (list[-1])
print (list[-2])
print (list[-3])

Submission status: Accepted

Solution code:
for i in sorted([input() for _ in xrange(10)])[:-4:-1]: print i

Submission status: Accepted

Solution code:
import sys

#list = sys.stdin.readlines()

i=0
list = []
for line in sys.stdin.readlines():
	list.append(int(line.strip("\n")))

print sorted(list, reverse=True)[0]
print sorted(list, reverse=True)[1]
print sorted(list, reverse=True)[2]

Submission status: Accepted

Solution code:
l=[]
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.sort()
l.reverse()
print l[0]
print l[1]
print l[2]

Submission status: Accepted

Solution code:
list = []
for i in  range(10):
    a = input()
    list.append(a)
list = sorted(list)
for i in range(-1, -4, -1):
    print(list[i])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#coding: utf-8

# Volume0 - 0001 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001)

li = []
for x in range(10):
    s = input()
    s = int(s)
    li.append(s)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    x=input()
    a.append(x)
a.sort()
for i in range(9,6,-1):
    print a[i]

Submission status: Accepted

Solution code:
p1 = 0
p2 = 0
p3 = 0
for i in range(10):
    d = int(raw_input())
    if (d > p1):
        p3 = p2
        p2 = p1
        p1 = d
    elif (d > p2):
        p3 = p2
        p2 = d
    elif (d > p3):
        p3 = d

print p1
print p2
print p3

Submission status: Accepted

Solution code:
mount=[]
for i in range(10):
  tmp=int(input())
  mount.append(tmp)
mount.sort()
mount.reverse()
for i in range(3):
    print(mount[i])

Submission status: Accepted

Solution code:
print "\n".join(map(str,sorted([input() for _ in [0]*10]))[::-1][0:3])

Submission status: Accepted

Solution code:
print"\n".join(map(str,sorted([input() for _ in [0]*10]))[::-1][0:3])

Submission status: Accepted

Solution code:
for i in sorted([input() for _ in [0]*10])[-1:-4:-1]:print i

Submission status: Accepted

Solution code:
import sys
mt_heights = map(int, sys.stdin.readlines())
mt_heights.sort(reverse=True)
for height in mt_heights[:3]:
    print height

Submission status: Accepted

Solution code:
#!/usr/bin/python
#-coding:utf8-

import sys

data = map(int,sys.stdin.read().split())
data.sort()
data.reverse()
for s in data[:3]:
  print s

Submission status: Accepted

Solution code:
import sys
a = []
s = sys.stdin.readline()
while s :
	a.append(int(s))
	s = sys.stdin.readline()

a.sort()
a.reverse()
for i in range(3) :
	print(a[i]);

Submission status: Accepted

Solution code:
for i in sorted([int(input()) for i in range(10)], reverse=True)[:3]: print(i)

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

import os
import sys

class Hoge(object):
    
    def __init__(self):
        pass

    def func(self):
        '''
        insert your code
        '''
        h = reversed(sorted(input() for i in range(10)))
        for i, e in enumerate(h):
            if i <= 2:
                print e
        return None

if __name__ == '__main__':
    h = Hoge()
    h.func()

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

m = []
for i in range(0,10):
    m.append(int(input()))

for i in range(0,3):
    print(list(reversed(sorted(m)))[i])

Submission status: Accepted

Solution code:
h = list()
for i in range(10): h.append(int(input()))
h.sort()
for i in range(-1,-4,-1): print h[i]

Submission status: Accepted

Solution code:
import sys
mount_list = map(int, sys.stdin.readlines())
mount_list.sort(reverse=True)
for x in mount_list[:3]:
	print x

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !
ret = []
for i in range(10):
    ret.append(int(input()))

ret.sort()

print(ret[-1])
print(ret[-2])
print(ret[-3])

Submission status: Accepted

Solution code:
a = sorted([int(input()) for i in range(10)],reverse=True)
for i in range(3):
	print(a[i])

Submission status: Accepted

Solution code:
import sys
tmp = []
for i  in range(10):
  line = input()
  tmp.append(line)
tmp.sort()
print tmp[-1]
print tmp[-2]
print tmp[-3]

Submission status: Accepted

Solution code:
hills = [input() for x in xrange(10)]
hills.sort(reverse=True)
for x in xrange(3):
	print hills[x]

Submission status: Accepted

Solution code:
list = []
for i in range(10):
    list.append(int(input()))
list.sort()
print(list[-1])
print(list[-2])
print(list[-3])

Submission status: Accepted

Solution code:
lis=[]

for i in range(10):
    h=int(input())
    lis.append(h)

for i in range(10):
    for j in range(i+1,10):
        if lis[i]<lis[j]:
            a=lis[i]
            lis[i]=lis[j]
            lis[j]=a

for i in range(3):
    print(lis[i])

Submission status: Accepted

Solution code:
mountains = [int(input()) for _ in range(10)]

for height in sorted(mountains)[-3:][::-1]:
    print(height)

Submission status: Accepted

Solution code:
H = []
while True:
	try:
		H.append(input())
	except EOFError:
		break
H.sort()
print(H[-1])
print(H[-2])
print(H[-3])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
hight = []
for i in range(10):
    hight.append(int(input()))
hight = sorted(hight, reverse=True)

for i in range(3):
    print(hight[i])

Submission status: Accepted

Solution code:
#! /usr/bin/python3

m=[int(input()) for i in range(10)]
m.sort()
m.reverse()
print("{0}\n{1}\n{2}".format(m[0], m[1], m[2]))

Submission status: Accepted

Solution code:
# coding: UTF-8
inputs=[]
for i in range(0,10):
    inputs.append(input())
inputs.sort(reverse=True)
#print "\n"
for i in range(0,3):
    print inputs[i]

Submission status: Accepted

Solution code:
data = []

for i in range(10):
	data.append(int(raw_input()))

data.sort(reverse = True)
print data[0]
print data[1]
print data[2]

Submission status: Accepted

Solution code:
import sys
heights = [int(i) for i in sys.stdin.read().split()]
heights.sort(reverse=True)
print("\n".join(map(str, heights[:3])))

Submission status: Accepted

Solution code:
ls = []
while True:
    try:
        n = int(raw_input())
    except EOFError:
        break

    ls.append(n)

ls.sort(reverse=True)
print ls[0]
print ls[1]
print ls[2]

Submission status: Accepted

Solution code:
L=[]

for i in range(0,10):
    x = raw_input()
    L.append(int(x))
L.sort()

for i in range(0,3):
    print L.pop()

Submission status: Accepted

Solution code:
spam = [int(input()) for i in range(0, 10)]
spam.sort()
spam.reverse()
for i in range(0,3):
    print(spam[i])

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

h = [int(input()) for i in range(10)]
h.sort()
h.reverse()

print(h[0])
print(h[1])
print(h[2])

Submission status: Accepted

Solution code:
A=[]
for i in range(10):
    A.append(int(raw_input()))
A.sort()
print A[-1]
print A[-2]
print A[-3]

Submission status: Accepted

Solution code:
inputNum = []

for i in range(0, 10):
  inputNum.append(int(raw_input()))

inputNum.sort(reverse=True)

for i in range(0, 3):
  print inputNum[i]

Submission status: Accepted

Solution code:
print "\n".join(map(str, sorted([input() for _ in xrange(10)])[:-4:-1]))

Submission status: Accepted

Solution code:
a = list(reversed(sorted([int(raw_input()) for _ in range(10)])))
print a[0]
print a[1]
print a[2]

Submission status: Accepted

Solution code:
list = []
for i in range(0, 10):
    t = int(raw_input())
    list.append(t)

list.sort(reverse=True)
for i in range(0, 3):
    print list[i]

Submission status: Accepted

Solution code:
lis = [ ]
for i in range ( 10 ):
  lis.append ( int ( input ( ) ) )
lis.sort ( )
for i in range ( 3 ):
  print ( lis.pop ( ) )

Submission status: Accepted

Solution code:
a=[int(input()) for i in range(10)]
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

Solution code:
# -*- config: utf-8 -*-
if __name__ == '__main__':
	hills = []
	for i in range(10):
		tmp = raw_input()
		hills.append(int(tmp))
	hills.sort(reverse=True)

	for i in range(3):
		print hills[i]

Submission status: Accepted

Solution code:
mnts = []
for t in xrange(0, 10):
	mnts.append(int(raw_input()))
tops = sorted(mnts, reverse = True)
for i in xrange(0, 3):
	print tops[i]

Submission status: Accepted

Solution code:
m = []
while True:
	try:
		m.append(int(raw_input()))
	except EOFError:
		break
m.sort()
m.reverse()
for h in m[0:3]:
	print h

Submission status: Accepted

Solution code:
for h in sorted([input() for i in range(10)])[:-4:-1]:print h

Submission status: Accepted

Solution code:
print "\n".join(map(str, sorted([int(raw_input()) for i in range(10)], reverse=True)[:3]))

Submission status: Accepted

Solution code:
#coding UTF-8

n = []
for i in range(10):
    n.append(input())
n.sort()
n.reverse()
for i in range(3):
    print n[i]

Submission status: Accepted

Solution code:
hills = []
for i in range(10):
    hills.append(int(input()))

hills.sort()
hills.reverse()

for i in range(3):
    print(hills[i])

Submission status: Accepted

Solution code:

array = []
for i in range(10):
    num = int(input())
    array.append(num)

list = sorted(array)
print(list[9])
print(list[8])
print(list[7])

Submission status: Accepted

Solution code:
def main():
    altitude_lis = []
    for i in range(10):
        input_line = raw_input()
        altitude = int(input_line)
        altitude_lis.append(altitude)
        
    altitude_lis.sort()
    altitude_lis.reverse()
    for i in range(3):
        print(altitude_lis[i])
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
height=[]
for i in range(10):
	height.append(int(input()))
height.sort()
height.reverse()
for i in range(3):
	print(height[i])

Submission status: Accepted

Solution code:
firstMountainHeight  = 0
secondMountainHeight = 0
thirdMountainHeight  = 0

while 1:

	try :

		i = int(raw_input())

		if firstMountainHeight    < i :
			thirdMountainHeight  = secondMountainHeight
			secondMountainHeight = firstMountainHeight
			firstMountainHeight  = i

		elif secondMountainHeight < i :
			thirdMountainHeight  = secondMountainHeight
			secondMountainHeight = i
			
		elif thirdMountainHeight  < i :
			thirdMountainHeight   = i
			
    	except:
	    	print"%d" % (firstMountainHeight)
	    	print"%d" % (secondMountainHeight)
	    	print"%d" % (thirdMountainHeight)

	    	break

Submission status: Accepted

Solution code:
firstMountainHeight  = 0
secondMountainHeight = 0
thirdMountainHeight  = 0
while 1:
	try :
		i = int(raw_input())
		if firstMountainHeight<i:
			thirdMountainHeight=secondMountainHeight
			secondMountainHeight=firstMountainHeight
			firstMountainHeight=i
		elif secondMountainHeight<i:
			thirdMountainHeight=secondMountainHeight
			secondMountainHeight=i
		elif thirdMountainHeight<i:
			thirdMountainHeight=i
    	except:
	    	print"%d" % (firstMountainHeight)
	    	print"%d" % (secondMountainHeight)
	    	print"%d" % (thirdMountainHeight)
	    	break

Submission status: Accepted

Solution code:
one  = 0
two = 0
three  = 0
while 1:
	try :
		i = int(raw_input())
		if one<i:
			three=two
			two=one
			one=i
		elif two<i:
			three=two
			two=i
		elif three<i:
			three=i
    	except:
	    	print"%d" % (one)
	    	print"%d" % (two)
	    	print"%d" % (three)
	    	break