// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *right,*left;
}node;
node *newnode,*root=NULL;

node* create(int num)
{
    newnode=(node*)malloc(sizeof(node));
    newnode->data=num;
    newnode->right=NULL;
    newnode->left=NULL;
    return newnode;
}

node* insert(node* root,int num)
{
    if(root==NULL)
    {
        return create(num);
    }
    if(num < root->data)
    {
        root->left=insert(root->left,num);
    }
    else if(num > root->data)
    {
        root->right=insert(root->right,num);
    }
    return root;
}
node* newinsert(node* root,int k)
{
    if(k <root->data)
    {
        root->left=insert(root->left);
    }
    else if(k > root->data)
    {
        root->right=insert(root->right);
    }
    return root;
}

void inorder(node* root)
{
    if(root!=NULL)
    {
        inorder(root->left);
        printf("%d ",root->data);
        inorder(root->right);
    }
}

int main()
{
    int size,num,k,i;
    scanf("%d",&size);
    scanf("%d",&k);
    for(i=0;i<size;i++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    newinsert(root,k);
    inorder(root);
}