#include<stdio.h>
#include<stdlib.h>

typedef struct node{
    int data;
    struct node *left, *right;
}Node;

Node* root=NULL;
Node* create(int num){
    Node *newNode = (Node*)malloc(1*sizeof(Node));
    newNode->data = num;
    newNode->left = NULL;
    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 if(num > root->data){
        root->right = insert(root->right,num);
    }
    return root;
}

void inOrder(Node* root, int count){
    if(root != NULL){
        inOrder(root->left);
        printf("%d ",root->data);
        inOrder(root->right);
        count++
    }
    printf("%d",count);
}

int main(){
    int size,X,i,num,count=0;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    scanf("%d",&X);
    if(X<0){
        printf("Invalid input");
        return 0;
    }
    for(i=1;i<=size;i++){
        scanf("%d",&num);
        root = insert(root,num);
    }
    root = insert(root,X);
    inOrder(root,count);
    return 0;
}