#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+1 < v.size(); ++i){
cout << v[i] << " ";
}
}
//1 9 2 3 4 1 6 6 5 3 8
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp2b2lkIGJ1YmJsZV9zb3J0KHZlY3RvcjxpbnQ+ICZ2KXsKCQlib29sIHVub3JkZXJlZCA9IHYuc2l6ZSgpID4gMTsgLy9mbGFnYQoJd2hpbGUgKHVub3JkZXJlZCkgewoKCXVub3JkZXJlZCA9IGZhbHNlOwoJZm9yIChpbnQgaSA9IDA7IGkrMSA8IHYuc2l6ZSgpOyArK2kpewoJCWlmICh2W2ldID4gdltpKzFdKXsKCQkJc3dhcCh2W2ldLCB2W2krMV0pOwogICAgIAoJCQl1bm9yZGVyZWQgPSB0cnVlOwoJCQkKCQl9CiAgY291dCA8PCB2W2ldIDw8ICIgIjsKCX0KIGNvdXQ8PGVuZGw7CiAgCiAgCn0KfQppbnQgbWFpbigpCnsKCXZlY3RvcjxpbnQ+IHY7Cglmb3IgKGludCBuOyBjaW4gPj4gbjspewoJdi5wdXNoX2JhY2sobik7IH0KCS8vZnVua2NqYSBjbyBzb3J0dWplIHdrZXRvcgpidWJibGVfc29ydCh2KTsKCS8va29uaWVjIGYKCWZvciAoaW50IGkgPSAwOyBpKzEgPCB2LnNpemUoKTsgKytpKXsKCQljb3V0IDw8IHZbaV0gPDwgIiAiOwoJfQoKfQoKLy8xIDkgMiAzIDQgMSA2IDYgNSAzIDgKCg==