#include <iostream>
#include <vector>
using namespace std;
void bubble_sort(vector<int> &v){
		bool unordered = v.size() > 1; //flaga
	while (unordered) {

	unordered = false;
	for (int i = 0; i+1 < v.size(); ++i){
		if (v[i] > v[i+1]){
			swap(v[i], v[i+1]);
     
			unordered = true;
			
		}
  cout << v[i] << " ";
	}
 cout<<endl;
  
  
}
}
int main()
{
	vector<int> v;
	for (int n; cin >> n;){
	v.push_back(n); }
	//funkcja co sortuje wketor
bubble_sort(v);
	//koniec f
	for (int i = 0; i < v.size(); ++i){
		cout << v[i] << " ";
	}

}

//1 9 2 3 4 1 6 6 5 3 8