Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[i])
	}
}

Python: a = []
for i in range(10):
    a.append(int(input()))
#print(a)
ad = sorted(a, reverse=True)
for i in ad[:3]:
    print("{}".format(i))

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

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

Python: import sys
e = [int(i) for i in sys.stdin.readlines()]
for i in range(3):
    m = max(e)
    e.remove(m)
    print (m)

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

y=sorted(x)
print(y[9])
print(y[8])
print(y[7])

Python: print(*sorted([int(input()) for _ in range(10)])[:-4:-1], sep="\n")

Python: if __name__ == '__main__':
    a = [1819, 2003, 876, 2840, 1723, 1673, 3776, 2848, 1592, 922]
    print(sorted(a, reverse=True)[1:4])

Python: mount_list = []

for i in range(1, 11):
  mount_list.append(int(input("Height of mountain" + str(i) + ":")))

mount_list.sort(reverse = True)

for sorted_mounts in mount_list:
  print(sorted_mounts)

Python: ans = []

for i in range(10):
  a = int(input())
  ans.append(a)
ans = sorted(ans, reverse=True)
print(*ans[:3],sep='\n')

Python: import itertools

l = [int(input()) for i in range(10)]
r = reversed(sorted(l))
for x in itertools.islice(r, 3):
    print(x)

Python: if __name__ == '__main__':
    lst = []
    for i in range(10):
        n = int(input())
        lst.append(n)
    lst.sort(reverse=True)
    for i in range(3):
        print(lst[i])

Python: a=[]
for i in range(10):
    num = int(input())
    a.append(num)
a=sorted(a)
for i in range(3):
    print('{0}'.format(a[9-i]))

Python: #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)

Python: x1=[]
for i in range(10):
    h=int(input())
    x1.append(h)
x=sorted(x1,reverse=True)
print(x[0])
print(x[1])
print(x[2])

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

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

for i in range(10):
    for j in range(i,10):
        if (heights[j] > heights[i]):
            w = heights[i]
            heights[i] = heights[j]
            heights[j] = w

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

Python: first = 0;
second = 0;
third = 0;
for var in range(0,10):
	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)

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

datah = sorted(data, reverse = True)

print(*(datah[:1]))
print(*(datah[1:2]))
print(*(datah[2:3]))

Python: #!/usr/bin/python
# -*- coding: utf-8 -*-

def sort(lst):
  for i in range(len(lst)):
    m = i
    for j in range(i+1,len(lst)):
      if lst[j] > lst[m]:
        m = j
    # swapping 
    tmp = lst[i]
    lst[i] = lst[m]
    lst[m] = tmp
  return lst

lst=[] # initialize
for i in range(10):
  lst.append(int(input()))
lst = sort(lst)
print("%d\n%d\n%d"%(lst[0],lst[1],lst[2]))

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

for i in range(10):
    for j in range(9,0,-1):
        if hlist[j-1]<hlist[j]:
            hlist[j-1],hlist[j] = hlist[j],hlist[j-1]

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

Python: #coding:utf-8

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

h = sorted(h,reverse = True)
for i in h[:3]:
	print(i)

Python: lst = [int(input()) for _ in range(10)]
lst.sort()
for i in range(3):
    print(lst[9 - i])

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

def main():
	mountains = []
	for i in range(10):
		mountains.append(int(input()))
	
	mountains = sorted(mountains, reverse = True)

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


if __name__ == '__main__':
    main()

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