#include<stdio.h>
#include<stdlib.h>
struct Node{
    int data;
    struct Node *left;
    struct Node *right;
};
struct Node* createNode(int value){
    struct Node* newnode=(struct Node *)malloc(sizeof(struct Node));
    newNode->data = value;
    newNode->left = newNode->right = NULL;
    return newNode;
}
struct Node* insert(struct Node *root,int value){
    if(root == NULL)
    return createNode(value);
    
    if(value<root->data)
    root->left=insert(root->left,value);
    else if(value->root->data)
    root->right=insert(root->right,value);
    return root;
}
struct Node*minNode(struct Node*root){
    while(root->left!=NULL)
    root=root->left;
    return root;
}

struct Node*deleteNode(struct Node*root,int key){
    if(root == NULL)
    return NULL;

    if(key < root->data)
        root->left=deleteNode(root->left, key);
    else if(key > root->data)
        root->right=deleteNode(root->right, key);
    else{
        if(root->left == NULL){
            struct Node* temp = root->right;
            free(root);
            return temp;
        }
        else if(root->right == NULL){
            struct Node* temp = root->left;
            free(root);
            return temp;
        }
            struct Node*temp=minNode(root->right);
            root->data=temp->data;
            root->right=deleteNode(root->right,temp->data);
    }
    return root;
}
 
 
 
   void preOrder(struct Node* root){
       if(root!=NULL){
        printf(" %d", root->data);
        preOrder(root->left);
        preOrder(root->right);
       }
   }
   int isValid(int n){
       return(n>=0 && n<=20);
   }
   int main(){
       int n,x;
        
        if(scanf("%d%d",&n,&x)!=2 || !isValid(n)){
            printf("Invalid input\n");
            return 0;
        } 
       struct Node *root=NULL;
       int val;
       for(int i=0;i<n;i++){
           if(scanf("%d",&val)!=1 || val<0||val>1000){
               printf("Invalid input");
               return 0;
           }
       
           root=insert(root,val);
       }
       root = deleteNode(root,x);
       preOrder(root);
        printf("\n");
       return 0;
   }