#include <bits/stdc++.h>
using namespace std;
void insert_sort(int *a, int n) {
for (int i = 0; i < n; ++i) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] >= a[j + 1])swap(a[j], a[j + 1]);
}
}
}//插入排序
int main() {
int n, x;
while (cin >> n >> x) {//在n个整数中插入x
if (n == 0 && x == 0)break;
int a[n + 1];
for (int i = 0; i < n; i++)cin >> a[i];
a[n] = x;
insert_sort(a, n + 1);//调用排序函数
for (auto &e:a) {
cout << e << " ";
}//auto输出更加简洁方便
}
return 0;
}