import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main {
	static int [] nums;
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] array = br.readLine().split(" ");
		nums = new int[array.length];
		for(int i=0;i<nums.length;i++) nums[i]=Integer.parseInt(array[i]);
		qsort(nums, 0, nums.length-1);
    	System.out.println(nums[0]+" "+nums[1]+" "+nums[2]);
    }
	
	static void qsort(int[] numbers, int left, int right){
		if (left<=right) {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		}
	}
} import java.io.BufferedReader; BufferedReader java.io import java.io.InputStreamReader; InputStreamReader java.io class Main {
	static int [] nums;
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] array = br.readLine().split(" ");
		nums = new int[array.length];
		for(int i=0;i<nums.length;i++) nums[i]=Integer.parseInt(array[i]);
		qsort(nums, 0, nums.length-1);
    	System.out.println(nums[0]+" "+nums[1]+" "+nums[2]);
    }
	
	static void qsort(int[] numbers, int left, int right){
		if (left<=right) {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		}
	}
} Main static int [] nums; nums public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] array = br.readLine().split(" ");
		nums = new int[array.length];
		for(int i=0;i<nums.length;i++) nums[i]=Integer.parseInt(array[i]);
		qsort(nums, 0, nums.length-1);
    	System.out.println(nums[0]+" "+nums[1]+" "+nums[2]);
    } main {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] array = br.readLine().split(" ");
		nums = new int[array.length];
		for(int i=0;i<nums.length;i++) nums[i]=Integer.parseInt(array[i]);
		qsort(nums, 0, nums.length-1);
    	System.out.println(nums[0]+" "+nums[1]+" "+nums[2]);
    } BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); br new BufferedReader(new InputStreamReader(System.in)) String[] array = br.readLine().split(" "); array br.readLine().split(" ") br.readLine().split br.readLine() br.readLine br " " nums = new int[array.length] nums new int[array.length] array.length array array.length for(int i=0;i<nums.length;i++) nums[i]=Integer.parseInt(array[i]); int i=0; int i=0; i 0 i<nums.length i nums.length nums nums.length i++ i++ i nums[i]=Integer.parseInt(array[i]); nums[i]=Integer.parseInt(array[i]) nums[i] nums i Integer.parseInt(array[i]) Integer.parseInt Integer array[i] array i qsort(nums, 0, nums.length-1) qsort nums 0 nums.length-1 nums.length nums nums.length 1 System.out.println(nums[0]+" "+nums[1]+" "+nums[2]) System.out.println System.out System System.out nums[0]+" "+nums[1]+" "+nums[2] " " nums[1] nums[0]+" "+nums[1]+" "+nums[2] nums[0] nums 0 " " nums[1] nums 1 " " nums[2] nums 2 String[] args args static void qsort(int[] numbers, int left, int right){
		if (left<=right) {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		}
	} qsort {
		if (left<=right) {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		}
	} if (left<=right) {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		} left<=right left right {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		} int center=numbers[(left+right)/2]; center numbers[(left+right)/2] numbers (left+right)/2 (left+right) left right 2 int l=left; l left int r=right; r right while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			} l<=r l r {
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			} while(numbers[l]<center) l++; numbers[l]<center numbers[l] numbers l center l++ l while(numbers[r]>center) r--; numbers[r]>center numbers[r] numbers r center r-- r if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				} l<=r l r {
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				} int tmp=numbers[l]; tmp numbers[l] numbers l numbers[l]=numbers[r] numbers[l] numbers l numbers[r] numbers r numbers[r]=tmp numbers[r] numbers r tmp l++ l r-- r qsort(numbers, left, r) qsort numbers left r qsort(numbers, l, right) qsort numbers l right int[] numbers numbers int left left int right right
import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main {
	static int [] nums;
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] array = br.readLine().split(" ");
		nums = new int[array.length];
		for(int i=0;i<nums.length;i++) nums[i]=Integer.parseInt(array[i]);
		qsort(nums, 0, nums.length-1);
    	System.out.println(nums[0]+" "+nums[1]+" "+nums[2]);
    }
	
	static void qsort(int[] numbers, int left, int right){
		if (left<=right) {
			int center=numbers[(left+right)/2];
			int l=left;
			int r=right;
			while(l<=r){
				while(numbers[l]<center) l++;
				while(numbers[r]>center) r--;
				if(l<=r){
					int tmp=numbers[l];
					numbers[l]=numbers[r];
					numbers[r]=tmp;
					l++;
					r--;
				}
			}
			qsort(numbers, left, r);
			qsort(numbers, l, right);
		}
	}
}