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