Go: package main

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

var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func toInt(str string) int {
	n, _ := strconv.Atoi(str)
	return n
}

func main() {
	lst := make([]int, 0)
	for i := 0; i < 10; i++ {
		lst = append(lst, toInt(readLine()))
	}
	sort.Ints(lst)
	for i := 9; i > 6; i-- {
		fmt.Println(lst[i])
	}
}

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

Python: # coding: utf-8
# 49

T = [int(input()) for i in range(10)]

T.sort()

print(T[9])
print(T[8])
print(T[7])

Python: lst=[]
for i in range(10):
    x = int(input())
    lst.append(x)
lstx=sorted(lst)[7:]
print(lstx[2])
print(lstx[1])
print(lstx[0])

Python: height=[]
for i in xrange(10):
    mountain=input()
    height.append(mountain)
height.reverse()
for i in xrange(3):
    print(height[i])

Python: list = [int(x) for x in input().split()]
list.sort()
for i in range(3):
    print(list[i])

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

Python: t=sorted([int(input()) for i in range(10)])
[print(i) for i in [t[-1],t[-2],t[-3]]]

Python: lis=[];

for i in range(10):
    h=int(input());
    lis.append(h);
    
for i in range(10):
    for j in range(10):
        if lis[i]<lis[j]:
            a=lis[i];
            lis[i]=lis[j];
            lis[j]=a;
            
for i in range(3):
    print(lis[i]);

Python: height_list = [int(input()) for i in range(10)]
for i in range(1,4): print(sorted(height_list)[-i])

Python: import sys

a = sorted([int(x) for x in sys.stdin.readlines()], reverse=True)
for i in range(3):
    print(a[i])

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

Python: from heapq import heappush, heappop
import sys 

def heapsort(itr):
    h=[]
    [heappush(h, int(val)) for val in itr]
    return [heappop(h) for i in range(len(h))]

def rep(s):
    return s.strip()

l = heapsort(list(map(rep, sys.stdin.readlines())))
l.reverse()

print(str(l[0])+' '+str(l[1])+' '+str(l[2]))

Python: mtlist=[]

while True:
    mtlist.append(input())
    mt
print(list.sort())

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

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

Python: height = [0 for i in range(10)]
sort_height = [0 for i in range(10)]

#set
for i in range(10):
    height[i] = int(input())

#sort
for i in range(10):
    for j in range(10):
        if height[i] >= sort_height[j]:
            #?????????
            for k in range(9, j, -1):
                sort_height[k] = sort_height[k-1] 

            sort_height[j] = height[i]
            break
        
for i in range(3):
    print(sort_height[i])

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

x.sort(reverse=True)

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

Python: a=list(map(int,input().split()))
b=sorted(a, reverse=True)
print(b[0])
print(b[1])
print(b[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: h = [int(input()) for i in range(10)]
h.sort(reverse = True)
for i in range(3):
    print(h[i])

Python: import sys

a = []
for i in range(10):
    a.append(int(input()))
#num = [1819, 2003, 876, 2840, 1723, 1673, 3776, 2848, 1592, 922]
a.sort(reverse = True)
print(a[0])
print(a[1])
print(a[2])

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

yama = sorted(yama , reverse = True)

for n in range(3):
    print(yama[n])

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

high=[0,0,0]
for i in range(10):
    if  mt[i] > high[0]:
        high=[mt[i]]+high[:2]
    elif mt[i] > high[1]:
        high=[high[0]]+[mt[1]]+[high[1]]
    elif mt[i] > high[2]:
        high=high[:2]+[mt[i]]
print(high,sep='\n')

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

a.sort()
for i in range(3):
	print(a.pop())

Python: a,b = [],[]

for i in range(10):
    a.append(int(input()))
    
a.sort(reverse=True)

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

Python: import sys

a = []
for line in sys.stdin:
    a.append(int(line))
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

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

myList.sort()
myList.reverse()

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

Python: def main():
    l = []
    for _ in range(10):
        l.append(input())
    l = sorted(l, reverse=True)
    for i in range(3):
        print(l[i])
    return None

if __name__ == '__main__':
    main()

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

Python: num =[0,0,0]

for a in range(10):
    x = int(input().rstrip())
    if x > num[0]:
        num[2] = num[1]
        num[1] = num[0]
        num[0] = x
        continue 
    elif x > num[1]:
        num[2] = num[1]
        num[1] = x
        continue 
    elif x > num[2]:
        num[2] = x
for a in range(3):
    print(num[a])

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

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

Python: from sys import stdin

x = [int(input()) for i in range(10)]

x.sort(reverse=True)

for i in x[:3]: print(i)

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

Python: N = input()
a = []
for i in range(N):
    a.append(input())
for i in range(3):
    m = max(a)
    a.remove(m)
    print (m)

Python: High = []
for i in range(10):
    High.append(int(input()))
for i in range(3):
    print(max(High))
    High.remove(max(High))

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

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

def main():
    list = []
    for i in range(10):
        list.append(int(input()))
    list.sort(lambda num_1, num_2: num_2 - num_1)
    for i in range(3):
        print(list[i])

if __name__ == '__main__':
    main()

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

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

for i in range(0,9):
    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: data=[]
for i in range(10):
    data.append(int(input()))
data.sort()
data.reverse()
for i in range(3):
    print(data[i])

Python: from sys import stdin
map(print,sorted([int(l) for l in stdin],reverse=True)[0:3])

Python: a=[]
for i in range(10):
    a.append(int(input()))
counter=3
for u in list(reversed(sorted(a))):
    print(u)
    counter-=1
    if counter==0:
        break

Python: spam = [int(input()) for i in range(0, 10)]
spam.sort()
spam.reverse()
for i in range(1, 3):
    print('{}'.format(spam[i]))

Python: import sys

a = []
for line in sys.stdin:
    a.append(int(line))

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

Python: f, s, t = 3,2,1
for i in range(10):
    z = int(input())
    if z >= f:
        f,s,t = z, f, s;
    elif z>=s:
        s,t = z,s;
    elif z>=t:
        t = z
print(f);print(s);print(t)

Python: heightOfMountains = []
for i in range(1, 11):
	heightOfMountains.append(int(input()))
heightOfMountains.sort()
for i in range(1, 4):
	print(heightOfMountains[-i])