// editor3
#include<stdio.h>
#include<stdlib.h>
typedef struct treenode{
    int data;
    struct treenode *right;
    struct treenode *left;
}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 *insert(node *root,int num){
    if(root == NULL)
    return create(num);
    if(num < root->data)
    root->left = insert(root->left,num);
    else
    root->right = insert(root->right,num);
    return root;
}
int search(node *root,int tar){
    if(root->data==tar)
        return 1;
        if(tar<root->data)
        return search(root->left,tar);
        else
        return search(root->right,tar);
        return 0;
    
}
int main(){
    int size,val,num,i;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    scanf("%d",&val);
        if(val<0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<size;i++){
        scanf("%d",&num);
        root = insert(root,num);

    }

    root = insert(root,val);
    search(root);
    return 0;
}