#include<iostream>
#include<vector>
using namespace std;
void QuickSort(vector<int> & array, int l, int r)
{
int x;
int i=l,j=r;
if(l>=r)
return;
x=array[l];
while(l<r)
{
while((l<r)&&(array[r]>x)) //從右向左
r--;
if(l<r)
array[l++]=array[r];
while((l<r)&&(array[l]<x))
l++;
if(l<r)
array[r--]=array[l];
}
array[l]=x;
QuickSort(array,i,l-1);
QuickSort(array,l+1,j);
}
int main()
{
vector<int>array;
int a,i,j;
while(scanf("%d",&a))
{
array.push_back(a);
}
QuickSort(array,0,array.size()-1);
vector<int>::iterator iter;
for(iter=array.begin();iter!=array.end();iter++)
{
if(*iter!=array[array.size()-1])
cout<<*iter<<" ";
else
cout<<*iter<<" ";
}
return 0;
}