#include<stdio.h>
#include<stdlib.h>
struct TreeNode{
    int data;
    struct TreeNode*left;
    struct TreeNode*right;
};
struct TreeNode*createNode(int value){
    struct TreeNode*newNode=(struct TreeNode*)maaloc(sizeof(struct TreeNode));
    newNode->data=value;
    newNode->left= newNode->right=NULL;
    return newNode;
}
struct TreeNode*insert(struct TreeNode*root,int value){
    if(root == NULL){
        return createNode(value);
    }
    if(value<root->data){
        root->left = insert(root->left,value);
    } else {
        root->right = insert(root->right,value);
    }
    return root;
}
void inorderTraversal(struct TreeNode*root){
    if(root!=NULL){
        inorderTraversal(root->left);
        printf("%d",root->data);
        inorderTraversal(root->right);
    }
}
int main(){
    int N,X;
    scanf("%d",&N);
    scanf("%d",&X);
    if(N<0||X<0){
        printf("Invalid input");
        return 0;
    }
    struct TreeNode*root=NULL;
    int value;
    for(int i=0;i<N;i++){
        scanf("%d",&value);
        root=insert(root,value);
    }
    root=insert(root,X);
    inorderTraversal(root);
    return 0;
}