#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*insert(node*root,int num){
    if(root==NULL){
        return create(num);
    }
    if(root->data<val){
        root->left=insertBST(root->left,num);
    }
    else{
        root->right=insertBST(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);
    for(i=0;i<size;i++){
        scanf("%d",&num);
        root = insertBST(root,num);
    }
    node*insertBST(root,val);
        sortedorder(root);
        return 0;
}