Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	counter := 0
	var mountain []int
	for scanner.Scan() {
		i, err := strconv.Atoi(scanner.Text())
		if err != nil {
			break
		}
		mountain = append(mountain, i)
		counter++
		if counter == 10 {
			break
		}

	}
	sort.Ints(mountain)
	fmt.Println(mountain[9])
	fmt.Println(mountain[8])
	fmt.Println(mountain[7])
}

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

for j in range(3):
    print(mountains.pop(mountains.index(max(mountains))))

Python: #coding: utf-8

a = []

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

a.sort(reverse=True)

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

Python: lis=[]
for i in range(10):
  lis.append(input())

for i,j in enumerate(sorted(lis,reverse=True)):
  print(i)
  if i==3:
    break

Python: m=list(int(input()) for i in range(10))
m.sort()
h=[print(m[i]) for i in range(9,6,-1)]

Python: 
n = [0,0,0,0,0,0,0,0,0,0]

for i in range( 0, 10 ):
    n[i] = int(input())

mv = 0
ma = 0

for i in range( 0, 3 ):
    for j in range( 0, 10 ):
        if mv < n[j]:
            mv = n[j]
            ma = j
    print( mv )
    n[ma] = -1
    mv = 0

Python: L=list(range(10))
for i in range(10):
    L[i]=int(input())
print(max(L))
L.remove(max(L))
print(max(L))
L.remove(max(L))
print(max(L))

Python: a = [int(input()) for i in range(10)]

a.reverse()
print(a[0])
print(a[1])
print(a[2])

Python: array = []
for _ in range(10):
    array.append(int(input()))

sorted_array = sorted(array,reverse=True)
for i in range(3):
    print(sorted_array[i])

Python: a=[]
for i in range(10):
    a.append(int(input()))
    a.sort()
    
print(f'{a[-1]}\n{a[-2]}\n{a[-3]}')

Python: mountains = [int(input()) for _ in range(10)]
print(*sorted(mountains, reverse=True)[:3], sep='\n')

Python: max = 0
middle = 0
small = 0
x = 0
for i in range(10):
	x = int(input())
	if max < x :
		middle = max
		max = x
		x = 0
	elif middle < x :
		small = middle
		middle = x
		x = 0
	elif small < x :
		small = x
		x = 0
print(max)
print(middle)
print(small)

Python: m_h=[int(input()) for i in range(10)]

m_h.sort(reverse=True)

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

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

Python: 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="")

Python: rank = sorted([int(input()) for i in range(10)], reverse=True)
print('\n'.join(map(str, rank[:3])))

Python: import sys
h=[int(i) for i in sys.stdin]
h.sort()
print(h[-1])
print(h[-2])
print(h[-3])

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

Python: h=[]
for i in range(10):
    h.append(int(input()))
h.sort()
print(h[9],h[8],h[7],sep='\n')

Python: array = []
for i in range(10):
 line = int(input())
 array += [line]

result = array.sort()[::-1]

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

Python: mountain=[]
for i in range(10):
    mountain.append(int(input()))
mountain.sort()
print(mountain[9])
print(mountain[8])
print(mountain[7])

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

Python: import sys

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

Python: m=[int(input()) for _ in range(10)]
m.sort(reverse=True)
print(m[0])
print(m[1])
print(m[2])

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

Python: values = []
for i in range(10):
    values.append(int(input()))

top3 = []
for i in range(3):
    Max = max(values)
    top3.append(Max)
    values.remove(Max)

for x in top3:
    print(x)

Python: import sys

l = [int(i) for i in sys.stdin]
l.sort(reverse=True)
for i in range(0, 3):
    print(l[i])

Python: # -*- coding:utf-8 -*-

first = 0
second = 0
third = 0
i = 0

for i in range(0,10):
    line = int(input())
    
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)
print(first)
print(second)
print(third)

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

Python: # coding: utf-8
mountain = [int(input()) for i in range(10)]
for i in range(3):
    print(max(mountain))
    mountain.remove(max(mountain))

Python: hight = []

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

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

Python: import sys
heights = sorted([ int(h) for h in sys.stdin],reverce)
for h in heights:
    print(h)

Python: heights = []

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

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

print()

data.sort()
data.reverse()

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

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

Python: #!/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]:
			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] )
			if i < len(a):
				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]))

Python: # coding: utf-8
# Your code here!

lul = []
for i in range(10):
    line = input()
    n = int(line)
    lul.append(n)

lul.sort()
print(str(lul[9]))
print(str(lul[8]))
print(str(lul[7]))

Python: h = [int(input()) for i in range(10)]
h.sort(reverse=True)
print(h[0])
print(h[1])
print(h[2])

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

Python: from sys import stdin

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

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

Python: height = [int(input()) for _ in range(10)]
for x in sorted(height, reverse = True)[:3]:
    print(x)

Python: m = [0 for i in range(10)]
for i in range(10):
    m[i] = int(input())
m.sort()
print(m[9])
print(m[8])
print(m[7])

Python: hight = []

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

hight.sort()
print(hight[0])
print(hight[1])
print(hight[2])

Python: import sys
#from me.io import dup_file_stdin

#@dup_file_stdin
def solve():
    m=[]
    for line in sys.stdin:
        m.append(int(line))
    m.sort(reverse=True)
    for h in m[0:3]:
        print(h)
solve()

Python: if __name__ == '__main__':
    # ??????????????\???
    mountains = [int(input()) for _ in range(10)]

    # ???????????????
    mountains.sort(reverse=True)

    # ???????????????
    print('{0}\n{1}\n{2}'.format(mountains[0], mountains[1], mountains[2]))

Python: list=[]
for i in range (10):
    n=int(input())
    list.append(n)
list.sort()
print(list[9])
print(list[8])
print(list[7])