Go: package main

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

func getsAsIntArray() (line []int) {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		str := scanner.Text()
		if str == "" {
			break
		}
		data, err := strconv.Atoi(str)
		if err != nil {
			break
		}
		line = append(line, data)
	}

	return
}

func main() {

	lines := getsAsIntArray()
	sort.Sort(sort.Reverse(sort.IntSlice(lines)))
	for i, v := range lines {
		if i < 3 {
			fmt.Println(v)
		}
	}
}

Python: n = 10
f,s,t = -1,-2,-3
for _ in range(n):
    inp = int(input())
    if inp > f:
        f,s,t = inp,f,s
    elif inp > s:
        s,t = inp,s
    elif inp > t:
        t = inp
print(f)
print(s)
print(t)

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

import sys

def top_k_sort(data, k=3, reverse=True):
    data.sort(reverse=True)
    return data[:k]

def main():
    data = map(int, raw_input().split())

    data = [int(v) for v in argv[1:]]
    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()

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

Python: A=[]
for i in range(10):
    m=int(input())
    A.append(m)
B=sorted(A)
print(B[-1])
print(B[-2])
print(B[-3])

Python: x=[]
for i in range(10):
    
    n=int(input())
    x.append(n)
x1=sorted(x,reverse=True)

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

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

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

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

Python: x=[]
for i in range(10):
    a=int(input())
    x.append(a)
    
print(max(x))
print(sorted(x)[-2])
print(sorted(x)[-3])

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

Python: mh=[]

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

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

Python: a=[int(input()) for i in range(10)]
a.sort(reverse=True)
for i, iv in enumerate(a):
	print(iv)
	if i >= 2:
		break

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

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

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

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

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

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

hills.sort()
hills.reverse()

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

Python: import sys

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

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

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

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

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

Python: hill = []
while True:
    try:
        hill.append(int(input()))
    except:
        break
for i in range(1, len(hill)):
    key = hill[i]
    j = i-1
    while j >= 0 and hill[j] < key:
        hill[j+1] = hill[j]
        j -= 1
    hill[j+1] = key

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

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

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

Python: heights = list()
for i in range(10):
    heights.append(int(input()))
for height in list(reversed(sorted(heights)))[:3]:
    print(height)

Python: [print(i) for i in (sorted([int(input()) for _ in range(10)])[:6:-1])]

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

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

Python: 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 = []
for _ in range(10):
    array.append(int(input('input integer')))

sorted_array = quicksort(array)
for i in range(3):
    print(sorted_array[9-i])

Python: # coding: utf-8
# Here your code !

import sys

n = [int(input()) for i in range (1,11)] 
#t = [int(input()) for i in range(n)] 
n.sort()
n.reverse()

for j in range (0,3):
    print(n[j])

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

h.sort()
h.reverse()

for i in range(3):
    print(h[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: 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 = []
for _ in range(10):
    array.append(int(input()))

sorted_array = quicksort(array)
for i in range(3):
    print(sorted_array[9-i])

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

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


top_heights = [int(i) for i in heights]
top_heights.sort()
top_heights.reverse()

for top in range(3):
    print(top_heights[top])

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

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

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

Python: h = []

for x in range(0,10):
    h.append(int(input()))

h.sort()
h.reverse()

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

Python: # coding=utf-8


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

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

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

Python: import numpy as np

heights = np.ndarray(10, dtype=int)

for i in range(10):
    N = input()
    heights[i] = N
    
sort_heights = np.sort(heights)[::-1]
print(sort_heights[0])
print(sort_heights[1])
print(sort_heights[2])

Python: from sys import stdin

ns = []
for n in stdin:
  ns.append(n)
ns.sort(reverse = True)
for i in range(3):
  print(ns[i])

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

lst.sort(reverse=True)
lst1=lst[0:3]
lst2=lst[1]
print(max(lst1))
print(lst2)
print(min(lst1))

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

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