#include<stdio.h>
#include<stdlib.h>
struct Node{
    int key;
    struct Node*left,*right;
    int height;
};
int height(struct Node*n){
    return n?n->height:0;
}
int max(int a,int b){
    return (a>b)?a:b;
}
struct Node *newNode(int Key){
    struct Node *node=(struct Node *)malloc(sizeof(struct Node));
    node->key=Key;
    node->left=node->right=NULL;
    node->height=1;
    return node;
}
struct Node*rightRotate(struct Node *y){
    struct Node*x=y->left;
    struct Node*T2=x->right;
    x->right=y;
    y->left=T2;
    y->height=max(height(y->left),height(y->right))+1;
    x->height=max(height(x->left),height(x->right))+1;
}
struct Node*leftRotate(struct Node *y){
    struct Node*y=x->right;
    struct Node*T2=y->left;
    y->left=x;
    x->right=T2;
    x->height=max(height(x->left),height(x->right))+1;
    y->height=max(height(y->left),height(y->right))+1;
}
int getBalance(struct Node *n){
    return n?height(n->left)-height(n->right):0;
}
struct Node*insert(struct Node *node,int key){
    if(!node)
    return newNode(key);
    if(key<node->key)
    node->left=insert(node->left,key);
    else if(key>node->key)
    node->right=insert(node->right,key);
    else
    return node;
    node->height=1+max(height(node->left),height(node->right));
    int bal=getBalance(node);
    if(bal>1&&key<node->left->key)
    return rightRotate(node);
    if(bal<-1&&key>node->right->key)
    return leftRotate(node);
    if(bal>1&&key>node->left->key){
        node->left=leftRotate(node->left);
        return rightRotate(node); 
    }
    if(bal<-1&&key<node->right->key){
        node->right=rightRotate(node->right);
        return leftRotate(node);
    }
    return node;
}
struct Node*minNode(struct Node*node){
    while(node->left)node=node->left;
    return node;
}
struct Node*deleteNode(struct Node*root,int Key){
    if(!root)
    return root;
    if(Key <root->key)
    root->left=deleteNode(root->left,Key);
    else if(Key >root->key)
    root->right=deleteNode(root->right,Key);
    else{
        if(!root->left|| !root->right){
            struct Node*temp=root->left?root->left:root->right;
            if(!temp){
                temp=root;
                root=NULL;
            }
            else*root=*temp;
            free(temp);
        }else{
            struct Node*temp=minNode(root->right);
            root->key=temp->key;
            root->right=deleteNode(root->right,temp->key);
        }
    }
    if(!root)
    return root;
    root->height=1+max(height(root->left),height(root->right));
    int bal=getBalance(root);
    if(bal>1&&getBalance(root->left)>=0)
    return rightRotate(root);
    if(bal>1&&getBalance(root->left)<0){
        root->left=leftRotate(root->left);
        return rightRotate(root);
    }
    if(bal<-1&&getBalance(root->right)<=0)
    return leftRotate(root);
    if(bal<-1&&getBalance(root->right)>0){
        root->right=rightRotate(root-> right);
        return leftRotate(root);
        }
        return root;
   }
   void preOrder(struct Node*root){
       if(root){
           printf("%d",root->key);
           preOrder(root->left);
           preOrder(root->right);
       }
   }
   int main(){
       int n,del;
       if(scanf("%d %d",&n,&del)!=2||n<0){
           printf("Invalid input");
           return 0;
       }
       struct Node *root=NULL;
       for(int i=0;i<n;i++){
           int val;
           if(scanf("%d",&val)!=1){
               printf("Invalid input");
               return 0;
           }
           root=insert(root,val);
       }
       root=deleteNode(root,del);
       preOrder(root);
       return 0;
   }