#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
    int data;
    struct Node *right;
    struct Node *left;
}node;
 node *head=NULL,*tail=NULL;
 void create(int num){
     node *newnode=(node*)malloc(sizeof(node));
     newnode->data=num;
     newnode->left=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);
    else
     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);
}
node* root=NULL;
int main(){
     int n,val,i,num;
     scanf("%d",&n);
     scanf("%d",&val);
     for(int i=0;i<n;i++){
         scanf("%d",&num);
         root=insert(root,num);
     }
     root=insert(root,val)
     inorder(root);
     return 0;
 }