Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	mountains := make([]int, 10)
	for i:=0; i<10; i++{
		mountains[i]=nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))
	for _, v := range mountains[:3]{
		fmt.Fprintln(out, v)
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

C++: /** || By The Name of Allah, Who Created Me. || **/

/**
	* Author   : Farid ul Islam Chy.
	* ID       : 1512020238.
	* Batch    : 38th.
	* Semester : 4C(E).
	* Team     : LU_AntiVirus.

	* Leading University, Sylhet.
**/

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#include <cstdio>
#include <vector>
#include <cstring>
#include <utility>
#include <ctype.h>
#include <iomanip>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <stdlib.h>
#include <fstream>

using namespace std;

#define ll    		    long long int
#define SS		    stringstream
#define pb    		    push_back
#define ull    		    unsigned long long int
#define MII        	    map <int,int>
#define MSI        	    map <string,int>
#define MIS        	    map <int,string>
#define MLI         	    map <long long int,int>
#define MIL        	    map <int,long long int>
#define MLL        	    map <ll,ll>
#define VS        	    vector <string>
#define VI        	    vector <ll>
#define VC        	    vector <char>
#define ForA(n)  	    for (int i=0; i<n; i++)
#define ForA2(n)  	    for (int j=0; j<n; j++)
#define ForA3(n)  	    for (int k=0; k<n; k++)
#define ForAS(n)  	    for (int i=n; i>0; i--)
#define ForN(n)  	    for (int i=1; i<=n; i++)
#define ForN2(n)  	    for (int j=1; j<=n; j++)
#define ForN3(n)  	    for (int k=1; k<=n; k++)
#define ForD(m,n)  	    for (int i=m; i<=n; i++)
#define ForD2(m,n)  	    for (int j=m; j<=n; j++)
#define ForD3(m,n) 	    for (int k=m; k<=n; k++)
#define SortA(n,x) 	    sort(n,n+x)
#define SortS(s)  	    sort(s.begin(), s.end())
#define SortRS(s)  	    sort(s.rbegin(), s.rend())
#define Search(s)           s.begin(), s.end()
#define SortSG(n)	    sort(n.begin(), n.end(), greater<int>())
#define Cin(a)		    cin>>a
#define GCin(a)		    getline(cin,a)
#define Cin2(a,b)	    cin>>a>>b
#define Cin3(a,b,c)	    cin>>a>>b>>c
#define Cin4(a,b,c,d)	    cin>>a>>b>>c>>d
#define PI 		    3.1415926535897932384626433832795l
#define Ignore		    cin.ignore()

int isprime(ll n){
     ll i;
     if(n==2) return 1;
     if(n%2==0) return 0;
     for(i=3;i<=sqrt(n);i+=2)
         if(n%i==0) return 0;
     return 1;
}

bool cmp(string i,string j){
    return i+j<j+i;
}

string ConvertItoS(ll n){
    SS a; a<<n;
    return a.str();
}

//ll ConvertStoI(string s){
//   return stoi(s);
//}

int main(){
    //freopen("in.txt","r",stdin)
    //freopen("out.txt","w",stdout)
    //cout<<fixed<<setprecision(2);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

	VI(v);
	ll m;

	ForA(10){
	    Cin(m);
	    v.pb(m);
	}
	SortS(v);
	ll len=v.size();
	cout<<v[len-1]<<endl;
	cout<<v[len-2]<<endl;
	cout<<v[len-3]<<endl;
	
    return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int s[10];
	int i,j,k,sum;
	for(i=0;i<=9;i++){
		scanf("%d",&s[i]);
	}
	sum=0;
	for(j=0;j<=9-1;j++){
	for(k=j+1;k<=9;k++){
		if(s[j]<=s[k]){
		sum=s[j];
		s[j]=s[k];
		s[k]=sum;
	}}}
	printf("%d\n",s[0]);
	printf("%d\n",s[1]);
	printf("%d\n",s[2]);
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
     
int main(){
  int a[10];
  for(int i=0;i<=10;i++){
    cin>>a[i];
  }
  sort(a,a+10);
  cout<<a[10]<<endl;
    cout<<a[9]<<endl;
  cout<<a[8]<<endl;
  return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
	int height;
	int high[3] = {0, 0, 0};
	for(int i=0;i<10;++i){
		cin >> height;
		if(height > high[0]){
			high[2] = high[1];
			high[1] = high[0];
			high[0] = height;
		}
		else if(height > high[1]){
			high[2] = high[1];
			high[1] = height;
		}
		else if(height > high[2]){
			high[2] = height;
		}
	}
	for(int i=0;i<3;++i){
		cout << high[i] << endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <iostream>
using namespace std;


int main()
{
	int i[10];
	cin >> i[1] >> i[2] >> i[3] >> i[4] >> i[5] >> i[6] >> i[7] >> i[8] >> i[9] >> i[10];
	sort(i, i+10);
	cout << i[1] << endl;
	cout << i[2] << endl;
	cout << i[3] << endl;

	return 0;
}

C++: #include <cstdio>
#include <algorithm>
  
using namespace std;
  
int main(void){
  int i,array[10];
  
  for(i=0;i<10;i++)  scanf("%d",&array[i]);
  sort(array,array+10);
  for(i=9;i>=7;i--)  printf("%d\n",array[i]);
  
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#define N 10

int main() {
    
    int list[N];
    
    for (int i = 0; i < N; i++) {
        cin>>list[i];
    }
    
    sort(list, list+N);
    
    for (int i = 9; i > 6; i--) {
        cout<<list[i]<<endl;
    }
    
    return 0;
}

C++: #include<iostream>
using namespace std;

int main(){

const int n = 3;
const int num = 10;
int t;

int a[num] = {0};
int b[n] = {0};
for(int i = 0; i < num; i++)
{
	cin >> a[i];
}
b[0] = a[0];
for(int i = 1; i < num; i++)
{
	t = a[i];
	for(int j = 0;j < n; j++)
	{
		if(t > b[j])
		{
			for(int k = n-1; k >= j+1; k--)
			{
			b[k] = b[k-1];
			}
		b[j] = t;
		break;
		}
	
	}

}
for(int i = 0;i < n;i++)
	cout << b[i] << "\n";
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int i,a[10];
    for(i=0;i<10;i++)
    scanf("%d",&a[i]);
    sort(a,a+10);
    printf("%d\n%d\n%d\n",a[9],a[8],a[7]);
    return 0;
}

C++: #include <iostream>
#define N 10

using namespace std;

void swap(int& a, int& b){
	int tmp = a;
	a = b;
	b = tmp;
}

void bubble_sort(int mountain[N]){
	for (int i=(N-1); i>0; --i){
		for (int j=i; j>0; --j){
			if (mountain[j-1] < mountain[j]){
				swap(mountain[j-1], mountain[j]);
			}
		}
	}
}

int main(void){
	int mountain[N];
	for (int i=0; i<N; ++i){
		int tmp;
		do{
			cin >> tmp;
		}while ((tmp<0) || (10000 < tmp));
		mountain[i] = tmp;
	}
	bubble_sort(mountain);
	cout << "output" << endl;
	for (int i=0; i<3; ++i){
		cout << mountain[i] << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>

using namespace std;

int main() {
	
	int A[10];
	
	while( cin >> A[0] ) {
		
		for(int i=1;i<10;i++)
		cin >> A[i];
			
		sort(A,A+10);
		
		for(int i=9;i>6;i--)
		cout << A[i] << "\n";
		
	}
		
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

int main(){
  vector<int> h(10);

  for(int i=0;i<10;++i) cin>>h[i];

  sort(begin(h),end(h),greater<int>());

  for(int i=0;i<3;++i) cout<<h[i]<<endl;
  return 0;
}

C++: #include <iostream>
#include <array>

using namespace std;

int main()
{
    int n = 10;
    int i = 0, j = 0;
    array<int, 10> arr;
    
    for (int i = 0; i < 10; i++)
    {
        cin >> arr[i];
    }
    
    for (i = 0; i < n - 1; i++)
    {
        for (j = i + 1; j < n; j++)
        {
            if (arr[i] < arr[j])
            {
                swap(arr[i], arr[j]);
            }
        }
    }
    
    for (i = 0; i < 3; i++)
    {
        cout << arr[i] << endl;
    }
    
    return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;

int main(){
    int mountain[10];
    
    for(int i=0;i<10;i++)
        //scanf("%d",&mountain[i]);
	cin>>mountain[i];
    for(int i=0;i<10;i++){
        for(int j=9;j>i;j--){
	    if(mountain[j]>mountain[j-1]){
            int temp = 0;
			temp = mountain[j];
			mountain[j] = mountain[j-1];
			mountain[j-1] = temp;
	    }
	}
    }

    //結果出力
    for(int i=0;i<3;i++)
         cout<<mountain[i]<<'\n';
    return 0;
}