#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left;
    struct node *right;
}Node;
Node *root=NULL;
Node *create(int num)
{
    Node*newNode=(Node*)malloc(sizeof(Node));
    newNode->data=num;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
}
void *insert(Node*root,int num)
{
    if(roott==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)
{
    if(root!=NULL)
    {
        inorder(root->left);
        printf("%d ",root->data);
        inorder(root->right);
    }
}
int main()
{
    int size,itr,x,num;
    scanf("%d",&size);
    scanf("%",&x);
    if(size<0) {
        printf("Invalid input");
        return 0;
    }
    for(itr=0;itr<size;itr++)
    {
        scanf("%d",&num);
        root=insert(root,x);
        inOrder(root);
        return 0;
    }
}