import java.util.Scanner;

public class Main {
	private final static int LIST_MAX = 10;
	private final static int INPUT_MIN = 0;
	private final static int INPUT_MAX = 10000;
	
	public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	}
	
	public static void show(int[] list){
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	}
	
	public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	}
	
	public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	}
	
	public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	}
} import java.util.Scanner; Scanner java.util public class Main {
	private final static int LIST_MAX = 10;
	private final static int INPUT_MIN = 0;
	private final static int INPUT_MAX = 10000;
	
	public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	}
	
	public static void show(int[] list){
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	}
	
	public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	}
	
	public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	}
	
	public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	}
} Main private final static int LIST_MAX = 10; LIST_MAX 10 private final static int INPUT_MIN = 0; INPUT_MIN 0 private final static int INPUT_MAX = 10000; INPUT_MAX 10000 public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	} main {
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	} int Mt_list[]; Mt_list Mt_list = input() Mt_list input() input sort(Mt_list) sort Mt_list show(Mt_list) show Mt_list String[]args args public static void show(int[] list){
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	} show {
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	} for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		} int i = 0; int i = 0; i 0 i < 3 i 3 i++ i++ i {
			System.out.println(list[i]);
		} {
			System.out.println(list[i]);
		} System.out.println(list[i]) System.out.println System.out System System.out list[i] list i int[] list list public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	} input {
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	} Scanner stdIn = new Scanner(System.in); stdIn new Scanner(System.in) int list[] = new int[LIST_MAX]; list new int[LIST_MAX] LIST_MAX for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		} int i = 0; int i = 0; i 0 i < LIST_MAX i LIST_MAX i++ i++ i {
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		} {
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		} int tmp = stdIn.nextInt(); tmp stdIn.nextInt() stdIn.nextInt stdIn if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			} input_ck(tmp) input_ck tmp {
				list[i] = tmp;
			} list[i] = tmp list[i] list i tmp {
				continue;
			} continue; stdIn.close() stdIn.close stdIn return list; list public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	} input_ck {
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	} if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		} INPUT_MIN <= x && x <= INPUT_MAX INPUT_MIN <= x INPUT_MIN x x <= INPUT_MAX x INPUT_MAX {
			return true;
		} return true; true return false; false int x x public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	} sort {
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	} for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		} int i = 0; int i = 0; i 0 i < LIST_MAX - 1 i LIST_MAX - 1 LIST_MAX 1 i++ i++ i {
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		} {
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		} for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			} int j = LIST_MAX - 1; int j = LIST_MAX - 1; j LIST_MAX - 1 LIST_MAX 1 j >= i + 1 j i + 1 i 1 j-- j-- j {
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			} {
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			} if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				} list[j - 1] < list[j] list[j - 1] list j - 1 j 1 list[j] list j {
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				} int work = list[j - 1]; work list[j - 1] list j - 1 j 1 list[j - 1] = list[j] list[j - 1] list j - 1 j 1 list[j] list j list[j] = work list[j] list j work return list; list int[] list list public class Main {
	private final static int LIST_MAX = 10;
	private final static int INPUT_MIN = 0;
	private final static int INPUT_MAX = 10000;
	
	public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	}
	
	public static void show(int[] list){
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	}
	
	public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	}
	
	public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	}
	
	public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	}
} public class Main {
	private final static int LIST_MAX = 10;
	private final static int INPUT_MIN = 0;
	private final static int INPUT_MAX = 10000;
	
	public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	}
	
	public static void show(int[] list){
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	}
	
	public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	}
	
	public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	}
	
	public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	}
} Main
import java.util.Scanner;

public class Main {
	private final static int LIST_MAX = 10;
	private final static int INPUT_MIN = 0;
	private final static int INPUT_MAX = 10000;
	
	public static void main(String[]args){
		int Mt_list[];
		Mt_list = input();
		
		sort(Mt_list);
		
		show(Mt_list);
	}
	
	public static void show(int[] list){
		for(int i = 0;i < 3;i++){
			System.out.println(list[i]);
		}
	}
	
	public static int[] input(){
		Scanner stdIn = new Scanner(System.in);
		int list[] = new int[LIST_MAX];
		
		for(int i = 0;i < LIST_MAX;i++){
			int tmp = stdIn.nextInt();
			if(input_ck(tmp)){
				list[i] = tmp;
			}else{
				continue;
			}
		}
		
		stdIn.close();
		return list;
	}
	
	public static boolean input_ck(int x){
		if(INPUT_MIN <= x && x <= INPUT_MAX){
			return true;
		}
		return false;
	}
	
	public static int[] sort(int[] list){
		for(int i = 0;i < LIST_MAX - 1;i++){
			for(int j = LIST_MAX - 1;j >= i + 1;j--){
				if(list[j - 1] < list[j]){
					int work = list[j - 1];
					list[j - 1] = list[j];
					list[j] = work;
				}
			}
		}
		return list;
	}
}