#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode*left;
    struct treeNode*right;
}node;
node *root=NULL;
node *create(int num){
    node *newnode=(node*)malloc(sizeof(node));
    newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}
node*insertBST(node*root,int num){
    if(root==NULL)
    return create(num);
    if(num<root->data)
    root->left=insertBST(root->left,num);
    else
     root->right=inserBST(root->right,num);
         return root;
}
void sortedorder(Node*root){
        if(root!=NULL){
            sortedorder(root->left);
            printf("%d",root->data);
            sortedorder(root->right);
        }
    }
int main()
    int(size,val,num);
    node *root=NULL;
    scanf("%d",&size);
    scanf("%d",&val);
    if(size<0||val<0){
        printf("Invalid input");
        return 0;
    }
for(i=0;i<size;i++){
    scanf("%d",&num);
    root=insertBST(root,num);
}
    root=insertBST(root,val);
    sortedorder(root);
return 0;
}