uses crt;

var A : array [1 .. 51] of integer;

    i, N, K, j : integer;

begin

clrscr;

readln(N, K);

for i := 1 to N do read(A[i]);

for j := N downto 2 do

    for i := 1 to j - 1 do

        if A[i] > A[i + 1] then

            begin

                A[i] := A[i] + A[i + 1];

                A[i + 1] := A[i] - A[i + 1];

                A[i] := A[i] - A[i + 1];

            end;

if K >= A[N] then i := N + 1 else

if K <= A[1] then i := 1 else

    for i := N downto 2 do

        if (A[i - 1] <= K) and (A[i] >= K) then break;

for j := N + 1 downto i + 1 do A[j] := A[j - 1];

A[i] := K;

for i := 1 to N + 1 do write(A[i],' ');

readln

end.

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, k; cin >> n >> k;
    vector <int > v;
    for (int i = 0; i < n; i++) {
     int tmp; cin >> tmp; v.push_back(tmp);
 }
 sort(v.begin(), v.end());
 v.push_back(k);
 for (int i = 0; i < v.size(); i++) cout << v[i] << ' ';
    return 0;
}