#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
Node *create(num);
{
    Node *newnode = (Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=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);
    if(num > root->data)
    root->right=insert(root->right,num);
    return root;
}
void inOrder(Node*root)
{
    if(root!=NULL)
    {
    inOrder(root->left);
    printf("%d ",root->data);
    inOrder(root->right);
    }
    
}
int main()
{
    int size,itr,num,x;
    scanf("%d",&size);
    scanf("%d",&x);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
        if(x<0)
        {
            printf("Invalid input");
            return 0;
        }
        for(itr=0;itr<size;itr++)
        {
            scanf("%d",&num);
            root=insert(root,num);
        }
        root=insert(root,x);
        inOrder(root);
        return 0;
}