Go: package main

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

var maxint = 10000
var scanner = bufio.NewScanner(os.Stdin)

func nextInt() (int, error) {
	scanner.Scan()
	return strconv.Atoi(scanner.Text())
}

func main() {
	scanner.Split(bufio.ScanWords)
	arr := make([]int, 10)
	for i := range arr {
		n, _ := nextInt()
		arr[i] = n
	}

	sort.Slice(arr, func(i, j int) bool {
		return arr[i] >= arr[j]
	})

	arrStr := fmt.Sprintf("%+v", arr[0:3])
	arrStr = arrStr[1:(len(arrStr) - 1)]
	arrStr = strings.Replace(arrStr, " ", "\n", -1)
	fmt.Println(arrStr)
}

Python: print(*sorted([int(input()) for i in range(10)])[:6:-1], sep='\n')

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

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

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

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

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

Python: # Aizu Problem 0001: List of Top 3 Hills
#
import sys, math, os

# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input2.txt", "rt")


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

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

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

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

Python: #a=list(map(int,input().split()))
a=[]
for i in range(10):
    tmp = int(input())
    a.append(tmp)
b=sorted(a, reverse=True)
print(b[0])
print(b[1])
print(b[2])

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

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

Python: import sys 
[print(d) for i, d in enumerate([i for i in sys.stdin].reverse()) if i < 3]

Python: 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]);

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

a.sort()

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

Python: A = raw_input()
B = [int(i) for i in A.split()]
sorted(list(B),reverse=True)[:3]

Python: import sys
def main():
    N = input()
    a = []
    for i in range(N):
        a.append(input())
    for i in range(3):
        m = max(a)
        a.remove(m)
        print (m)
        return 0    
if __name__ == "__main__":
    sys.exit(main())

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

num.sort()
print(num[9])
print(num[8])
print(num[7])

Python: mountains = [int(input()) for i in range(10)]
for i in sorted(mountains)[7:10][::-1]:
    print(i)

Python: l = []

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

l.sort()

for i in range(3):
    print(l[-1 * [i]])

Python: lis=[]
for i in range(10):
  lis.append(input())
 
for i,j in enumerate(sorted(lis,reverse=True)):
  print(j)
  if i==2:
    break

Python: import sys
mountains = [int(line.readline()) for line in sys.stdin]

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

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: a=[int(input()) for i in range(10)]

a.sort()

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

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

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

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

Python: a = [list(map(int,input().split()))for i in range(10)]
a = sorted(a)[::-1]
for i in a[:3]:
    print(*i, sep='\n')

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

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

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

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

Python: import string

count = 0
try:
    count += 1
    h[count] = int(input())
except:
    print("??????")

for i in range(len(h)):
    for j in range(len(h)-1):
        if int(h[i]) > int(h[j]):
            tmp = h[i]
            h[i] = h[j] 
            h[j] = tmp            
print(h[0])
print(h[1])
print(h[2])

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()
print(first)
print(second)
print(third)

Python: from sys import stdin

for x in sorted([int(l) for l in stdin],reverse=True)[0:3]:
  print(x)

Python: import numpy as np
from numpy.random import *

def quicksort(array):
    if len(array) < 2:
        return array # ?????¬??±??????
    else:
        pivot = array[0] # ?????°??±??????
        # ???????????????????°???????????????????????????¨?????????
        less = [i for i in array[1:] if i <= pivot]

        # ????????????????????§??????????????????????????¨?????????
        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = randint(0, 1000, 10) 
sorted_array = quicksort(array)
print(sorted_array[2])
print(sorted_array[1])
print(sorted_array[0])

Python: n=[]
for var in range(0, 10):
  n.append(int(raw_input()))
sorted(n,reverse=True)[:3]

Python: n=[int(input()) for i in range(10)]
b=sorted(n)
print(b[9])
print(b[8])
print(b[7])

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

Python: import sys

[print(len(str(y[0] + y[1]))) for y in [[int(z) for z in x.split()] for x in sys.stdin]]

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

Python: mountains = []

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

mountains.sort(reverse=True)

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

Python: heights = []

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

heights.sort()
print(heights[9])
print(heights[8])
print(heights[7])

Python: A=[]
F=[]
for i in range(0,10):
    B1=raw_input()
    B=int(B1)
    A.append(B)
for i in range(0,10):
    F.append(1)

for num in range(0,3):
    M=0
    m=0
    for i in range(0,10):    
        if(M<A[i]):
            if(F[i]==1):
                M=A[i]
                m=i
    print(M)
    F[m]=0

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

Python: m = [int(l) for l in input()]
m.sort()
print(sort[-1])
print(sort[-2])
print(sort[-3])

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