#include <iostream>
#include <deque>
#include <algorithm>
#include <functional>

using namespace std;

void Top3Mountains(int m1,int m2,int m3,int m4,int m5,int m6,int m7,int m8,int m9, int m10)
{
	deque<int> mountains;
	mountains.push_back(m1);
	mountains.push_back(m2);
	mountains.push_back(m3);
	mountains.push_back(m4);
	mountains.push_back(m5);
	mountains.push_back(m6);
	mountains.push_back(m7);
	mountains.push_back(m8);
	mountains.push_back(m9);
	mountains.push_back(m10);

	sort(mountains.begin(),mountains.end(),greater<int>());
	
	deque<int>::iterator it = mountains.begin();

	int i=0;
	for(i=0;i<3; i++){
		cout << *it << endl;
		it++;
	}

}

int main()
{

	Top3Mountains(1819,2003,876,2840,1723,1673,3776,2848,1592,922);
	return 0;
}