#include<iostream>
#include<vector>
using namespace std;
void merge(vector<int>&arr, int start, int mid, int end)
{
vector<int> tmp;
int i = start;
int j = mid+1;
while (i <= mid&&j <= end)
{
if (arr[i] <= arr[j])
tmp.push_back(arr[i++]);
else
tmp.push_back(arr[j++]);
}
while(i <= mid)
tmp.push_back(arr[i++]);
while (j <= end)
tmp.push_back(arr[j++]);
for (int i = 0; i < tmp.size(); i++)
arr[start + i] = tmp[i];
}
void mergeSort(vector<int>&arr, int start, int end)
{
if (arr.empty()||start >= end)
return;
int mid = (end + start) / 2;
mergeSort(arr, start, mid);
mergeSort(arr, mid+1, end);
merge(arr, start, mid, end);
for (int i = 0; i < arr.size(); i++)
{
cout << arr[i]<<" ";
}
cout << endl;
}
int main() {
int num;
vector<int > arr;
while (cin >> num)
{
arr.push_back(num);
}
mergeSort(arr, 0, arr.size() - 1);
for (int i = 0; i < arr.size(); i++)
{
cout << arr[i]<<' ';
}
system("pause");
return 0;
}